80 search results - page 8 / 16 » A conflict based SAW method for Constraint Satisfaction Prob... |
101
click to vote
AI
2003
Springer
15 years 5 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
CPAIOR
2007
Springer
15 years 5 months ago
2007
Springer
The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree...
CONSTRAINTS
2008
14 years 11 months ago
2008
Camera control techniques for Interactive Digital Entertainment (IDE) are reaching their limits in terms of capabilities. To enable future growth, new methods must be derived to a...
121
click to vote
AUSAI
2008
Springer
15 years 1 months ago
2008
Springer
Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approach soon ...
136
click to vote
AMAI
1999
Springer
14 years 11 months ago
1999
Springer
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...