1480 search results - page 21 / 296 » Ants can solve constraint satisfaction problems |
ECAIW
2000
Springer
14 years 3 months ago
2000
Springer
In this paper we present a tabu approach for a version of the Sports League Scheduling Problem. The approach adopted is based on a formulation of the problem as a Constraint Satisf...
EOR
2007
2007
Solving the short-term electrical generation scheduling problem by an adaptive evolutionary approach
13 years 11 months ago
In this paper, we introduce an adaptive evolutionary approach to solve the short-term electrical generation scheduling problem (STEGS). The STEGS is a hard constraint satisfaction...
CP
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
CP
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. Constraint Satisfaction Problems and Propositional Satisfiability, are frameworks widely used to represent and solve combinatorial problems. A concept of primary importan...
EMO
2003
Springer
14 years 4 months ago
2003
Springer
In this paper a Population-based Ant Colony Optimization approach is proposed to solve multi-criteria optimization problems where the population of solutions is chosen from the set...