VDict - Definition of Dining Philosophers Problem

search result for Dining Philosophers Problem in Computing (FOLDOC) dictionary

First < Previous 1 2 3 Next > Last

Dining Philosophers Problem DPP NP-complete backtracking toy problem banana problem satisfiability problem Hamiltonian problem search problem visionary decision problem halting problem graph colouring NP-hard nondeterministic polynomial time assignment problem sysape uninteresting knapsack problem PSL/PSA Hamilton's problem perfect programmer syndrome 0/1 knapsack problem magic bullet traveling salesman problem NAPSS space complexity NUXI problem AI-complete time complexity ZAPP feasible private-key cryptography vaxocentrism scalability computability theory register dancing punt image recognition liar paradox one-banana problem case based reasoning parallel processing travelling salesman problem fencepost error brute force decidability RTFS GNATS ID10T PEBCAK TSP PSA Trouble Came Back network management PSL open switch provably unsolvable post office problem frednet bytesexual snivitz PRISM QA4 Cray instability tweak William Hamilton complementary nondeterministic polynomial computational complexity CLEAR Modula-3*Control Program Hamiltonian tour 8 queens problem linear assignment Queens Problem Hamiltonian cycle eight queens problem Hamiltonian path PDS/MaGen

First < Previous 1 2 3 Next > Last