1480 search results - page 43 / 296 » Ants can solve constraint satisfaction problems |
192
click to vote
AMAI
2004
Springer
15 years 11 months ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
136
click to vote
IAT
2008
IEEE
16 years 19 days ago
2008
IEEE
The reason for using distributed constraint satisfaction algorithms is often to allow agents to find a solution while revealing as little as possible about their variables and co...
163
click to vote
CP
2001
Springer
15 years 10 months ago
2001
Springer
The Constraint Problems usually addressed fall into one of two models: the Constraint Satisfaction Problem (CSP) and the Constraint Optimization Problem (COP). However, in many rea...
140
click to vote
CP
1997
Springer
15 years 10 months ago
1997
Springer
This paper describes the combination of a well-known tsp heuristic, genius, with a constraint programming model for routing problems. The result, genius-cp, is an e cient heuristic...
273
click to vote
CP
2009
Springer
16 years 6 months ago
2009
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...