1480 search results - page 13 / 296 » Ants can solve constraint satisfaction problems |
WSTST
2005
Springer
14 years 3 months ago
2005
Springer
AAAI
1994
13 years 11 months ago
1994
CONSTRAINTS
2010
13 years 7 months ago
2010
This paper considers constraint propagation methods for continuous constraint satisfaction problems consisting of linear and quadratic constraints. All methods can be applied after...
SIAMDM
2008
13 years 9 months ago
2008
Recently, a strong link has been discovered between supermodularity on lattices and tractability of optimization problems known as maximum constraint satisfaction problems. The pre...
FOCS
2007
IEEE
14 years 4 months ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...