14386 search results - page 385 / 2878 » The Chinese Generals Problem |
166
click to vote
AAIM
2006
Springer
16 years 25 days ago
2006
Springer
Abstract. We give logarithmic approximation algorithms for the nonmetric uncapacitated multicommodity and multilevel facility location problems. The former algorithms are optimal u...
190
click to vote
WADS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract We show that if one can find the optimal value of an integer programming problem min{cx : Ax ≥ b, x ∈ Zn +} in polynomial time, then one can find an optimal solution...
144
click to vote
IWEC
2004
15 years 8 months ago
2004
This paper describes a number of general design problems with adventure-like computer games for young children in order to demonstrate the need for specific design guidelines for t...
164
click to vote
SIGCSE
2008
ACM
15 years 6 months ago
2008
ACM
: The generalized problem of placing n queens on an n-by-n board provides an "embarrassingly parallel" problem for parallel solution. This paper expands on the discussion...
164
click to vote
KBS
2007
15 years 6 months ago
2007
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...