808 search results - page 9 / 162 » A scaling algorithm for polynomial constraint satisfaction p... |
AAAI
1990
13 years 8 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
CP
2005
Springer
14 years 27 days ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
STOC
2005
ACM
14 years 7 months ago
2005
ACM
CP
2010
Springer
13 years 5 months ago
2010
Springer
Coupling constraints and ordinary differential equations has numerous applications. This paper shows how to introduce constraints involving ordinary differential equations into the...
AMAI
1999
Springer
13 years 7 months ago
1999
Springer
The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the el...