2157 search results - page 159 / 432 » Binary ant algorithm |
163
Voted
CSCLP
2007
Springer
16 years 10 days ago
2007
Springer
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...
123
Voted
IPPS
1993
IEEE
15 years 10 months ago
1993
IEEE
Abstract - Parallel algorithms of the hypercube allocation strategies are considered in this paper. Although the sequential algorithms of various hypercube allocation strategies ar...
130
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We present a faster exponential-time algorithm for integer optimization over quasi-convex polynomials. We study the minimization of a quasiconvex polynomial subject to s quasi-con...
146
click to vote
GECCO
2010
Springer
15 years 9 months ago
2010
Springer
Originally, genetic algorithms were developed based on the binary representation of candidate solutions in which each conjectured solution is a fixed-length string of binary numb...
162
click to vote
EVOW
2010
Springer
16 years 1 months ago
2010
Springer
Genetic algorithms (GAs) share a common weakness with most other metaheuristics: Candidate solutions are in general revisited multiple times, lowering diversity and wasting preciou...