99 search results - page 10 / 20 » Search Techniques for Non-linear Constraint Satisfaction Pro... |
ATAL
2010
Springer
13 years 7 months ago
2010
Springer
We present a fully distributed multi-agent planning algorithm. Our methodology uses distributed constraint satisfaction to coordinate between agents, and local planning to ensure ...
IRI
2006
IEEE
14 years 22 days ago
2006
IEEE
When a Constraint Satisfaction Problem (CSP) admits no solution, most current solvers express that the whole search space has been explored unsuccessfully but do not exhibit which...
SARA
2009
Springer
14 years 1 months ago
2009
Springer
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
AAAI
2007
13 years 9 months 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...
CPAIOR
2006
Springer
13 years 8 months ago
2006
Springer
As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft co...