Sciweavers

1480 search results - page 12 / 296
» Ants can solve constraint satisfaction problems
Sort
View
GECCO
1999
Springer
158views Optimization» more  GECCO 1999»
14 years 2 months ago
Coevolutionary Genetic Algorithms for Solving Dynamic Constraint Satisfaction Problems
In this paper, we discuss the adaptability of Coevolutionary Genetic Algorithms on dynamic environments. Our CGA consists of two populations: solution-level one and schema-level o...
Hisashi Handa, Osamu Katai, Tadataka Konishi, Mits...
EOR
2008
140views more  EOR 2008»
13 years 10 months ago
Combining two pheromone structures for solving the car sequencing problem with Ant Colony Optimization
The car sequencing problem involves scheduling cars along an assembly line while satisfying capacity constraints. In this paper, we describe an Ant Colony Optimization (ACO) algor...
Christine Solnon
JAIR
2010
130views more  JAIR 2010»
13 years 8 months ago
A Constraint Satisfaction Framework for Executing Perceptions and Actions in Diagrammatic Reasoning
Diagrammatic reasoning (DR) is pervasive in human problem solving as a powerful adjunct to symbolic reasoning based on language-like representations. The research reported in this...
Bonny Banerjee, B. Chandrasekaran
CORR
2007
Springer
111views Education» more  CORR 2007»
13 years 9 months ago
Circumspect descent prevails in solving random constraint satisfaction problems
Mikko Alava, John Ardelius, Erik Aurell, Petteri K...