1480 search results - page 46 / 296 » Ants can solve constraint satisfaction problems |
76
Voted
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
A genome rearrangement scenario describes a series of chromosome fusion, fission, and translocation operations that suffice to rewrite one genome into another. Exact algorithmic ...
IBERAMIA
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In constraint satisfaction, a general rule is to tackle the hardest part of a search problem first. In this paper, we introduce a parameter (τ) that measures the constr...
CORR
2004
Springer
14 years 9 months ago
2004
Springer
Social insect societies and more specifically ant colonies, are distributed systems that, in spite of the simplicity of their individuals, present a highly structured social organi...
NETWORKS
2007
14 years 9 months ago
2007
We consider a combination of the capacitated vehicle routing problem and a class of additional loading constraints involving a parallel machine scheduling problem. The work is mot...
86
Voted
DAGSTUHL
2006
14 years 11 months ago
2006
Abstract. The Galois connection involving polymorphisms and coclones has received a lot of attention in regard to constraint satisfaction problems. However, it fails if we are inte...