1197 search results - page 2 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
GECCO
2003
Springer
13 years 11 months ago
2003
Springer
Abstract. A method of automatic programming, called genetic programming, assumes that the desired program is found by using a genetic algorithm. We propose an idea of ant colony pr...
ASIAN
1999
Springer
13 years 10 months ago
1999
Springer
Abstract. Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. ...
AISB
1995
Springer
13 years 9 months ago
1995
Springer
This paper describes a form of dynamical computational system--4he ant colony---and presents an ant colony model for continuous space optimisation problems. The ant colony metapho...
CP
1995
Springer
13 years 9 months ago
1995
Springer
A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application...
GECCO
2006
Springer
13 years 9 months ago
2006
Springer
This paper presents a novel approach to solve the constrained unit commitment problem using Selective Self-Adaptive Ant System (SSAS) for improving search performance by automatic...