714 search results - page 66 / 143 » Lexicographically-ordered constraint satisfaction problems |
KBS
2007
13 years 10 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...
AAAI
2007
14 years 10 days ago
2007
We present a new probabilistic framework for finding likely variable assignments in difficult constraint satisfaction problems. Finding such assignments is key to efficient sea...
AGI
2008
13 years 11 months ago
2008
Whereas symbol
CP
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...
IDEAL
2003
Springer
14 years 3 months ago
2003
Springer
ERA is a multi-agent oriented method for solving constraint satisfaction problems [5]. In this method, agents make decisions based on the information obtained from their environmen...