1480 search results - page 25 / 296 » Ants can solve constraint satisfaction problems |
121
click to vote
PRICAI
1998
Springer
15 years 4 months ago
1998
Springer
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
JUCS
2006
14 years 11 months ago
2006
This paper presents a parameterized schema for interval constraint branching that (with suitable instantiations of the parameters) can solve interval constraint satisfaction probl...
129
click to vote
CP
2007
Springer
15 years 6 months ago
2007
Springer
While many real-world combinatorial problems can be advantageously modeled and solved using Constraint Programming, scalability remains a major issue in practice. Constraint models...
AAAI
2006
15 years 1 months ago
2006
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...
118
click to vote
WLP
2004
Springer
15 years 5 months ago
2004
Springer
Constraint programming provides a declarative approach to solving combinatorial (optimization) problems. The user just states the problem as a constraint satisfaction problem (CSP)...