1480 search results - page 32 / 296 » Ants can solve constraint satisfaction problems |
CP
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. Subquadrangles are a natural way in which to represent constraints as they do not restrict any subset of their scope. There are already known methods for converting any g...
AIR
2005
13 years 11 months ago
2005
Abstract. This paper presents the new DDAC4 algorithm for dynamic arc consistency enforcement in distributed Constraint Satisfaction Problems. The algorithm is an adaptation of the...
CISSE
2009
Springer
14 years 2 months ago
2009
Springer
: We show that estimating the complexity (mean and distribution) of the instances of a fixed size Constraint Satisfaction Problem (CSP) can be very hard. We deal with the main two ...
CEC
2007
IEEE
14 years 2 months ago
2007
IEEE
In this paper, we present an ant system algorithm variant designed to solve the job shop scheduling problem. The proposed approach is based on a recent biological study which showe...
JAR
2000
13 years 10 months ago
2000
We study the runtime distributions of backtrack procedures for propositional satisfiability and constraint satisfaction. Such procedures often exhibit a large variability in perfor...