314 search results - page 16 / 63 » A non-binary constraint ordering heuristic for constraint sa... |
IJIT
2004
13 years 9 months ago
2004
Cryptarithmetic problem is an interesting constraint satisfaction problem for which different algorithms have been given. But none of them can solve the problem intelligently using...
AUSAI
2005
Springer
13 years 9 months ago
2005
Springer
Abstract. Methods of adaptive constraint satisfaction have recently become of interest to overcome the limitations imposed on “black-box” search algorithms by the no free lunch...
AMAI
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We introduce a new global constraint which combines together the lexicographic ordering constraint with two sum constraints. Lexicographic ordering constraints are freque...
AI
2012
Springer
12 years 3 months ago
2012
Springer
This paper describes a challenging plan recognition problem that arises in environments in which agents engage widely in exploratory behavior, and presents new algorithms for eff...
CP
1997
Springer
13 years 11 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...