2157 search results - page 122 / 432 » Binary ant algorithm |
116
Voted
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
In recent decades, many meta-heuristics, including genetic algorithm (GA), ant colony optimization (ACO) and various local search (LS) procedures have been developed for solving a...
115
click to vote
CEC
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract— This paper presents a genetic algorithmic approach for finding efficient paths in directed graphs when optimizing multiple objectives. Its aim is to provide solutions...
121
click to vote
ANTSW
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. In this paper we present an estimation of distribution particle swarm optimization algorithm that borrows ideas from recent developments in ant colony optimization. In th...
114
click to vote
ASPDAC
2007
ACM
15 years 4 months ago
2007
ACM
- In routing, finding a rectilinear Steiner minimal tree (RSMT) is a fundamental problem. Today's design often contains rectilinear obstacles, like macro cells, IP blocks, and...
ICASSP
2008
IEEE
15 years 7 months ago
2008
IEEE
The maximization of a full-rank quadratic form over a finite alphabet is NP-hard in both a worst-case sense and an average sense. Interestingly, if the rank of the form is not a ...