2157 search results - page 57 / 432 » Binary ant algorithm |
GECCO
2007
Springer
14 years 5 months ago
2007
Springer
This research screens the tuning parameters of a combinatorial optimization heuristic. Specifically, it presents a Design of Experiments (DOE) approach that uses a Fractional Fac...
ANTSW
2004
Springer
14 years 4 months ago
2004
Springer
A general-purpose, simulation-based algorithm S-ACO for solving stochastic combinatorial optimization problems by means of the ant colony optimization (ACO) paradigm is investigate...
AAAI
1998
14 years 6 days ago
1998
It is well known that any non-binary discrete constraint satisfaction problem (CSP) can be translated into an equivalent binary CSP. Two translations are known: the dual graph tra...
KBSE
2009
IEEE
14 years 5 months ago
2009
IEEE
Abstract—Decisions regarding the mapping of software components to hardware nodes affect the quality of the resulting system. Making these decisions is hard when considering the ...
EOR
2008
13 years 11 months ago
2008
In this paper we present an extension of ant colony optimization (ACO) to continuous domains. We show how ACO, which was initially developed to be a metaheuristic for combinatoria...