1480 search results - page 67 / 296 » Ants can solve constraint satisfaction problems |
AI
2000
Springer
14 years 9 months ago
2000
Springer
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...
101
click to vote
EVOW
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The advancement of network induces great demands on a series of applications such as the multicast routing. This paper firstly makes a brief review on the algorithms in ...
HM
2009
Springer
15 years 2 months ago
2009
Springer
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
CAD
1998
Springer
14 years 9 months ago
1998
Springer
Abstract. This paper reports a geometric constraint solving approach based on symbolic computation. With this approach, we can compute robust numerical solutions for a set of equat...