1480 search results - page 35 / 296 » Ants can solve constraint satisfaction problems |
CORR
2007
Springer
13 years 10 months ago
2007
Springer
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
CP
2005
Springer
14 years 4 months ago
2005
Springer
When the search for a solution to a constraint satisfaction problem backtracks, it is not usually worthwhile to remember the assignment that failed, because the same assignment wil...
CPC
2006
13 years 11 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
PPSN
1998
Springer
14 years 3 months ago
1998
Springer
Many optimization problems require the satisfaction of constraints in addition to their objectives. When using an evolutionary algorithm to solve such problems, these constraints c...