Sciweavers

2157 search results - page 144 / 432
» Binary ant algorithm
Sort
View
128
Voted
CEC
2010
IEEE
15 years 3 months ago
Geometric Nelder-Mead Algorithm for the permutation representation
The Nelder-Mead Algorithm (NMA) is an almost half-century old method for numerical optimization, and it is a close relative of Particle Swarm Optimization (PSO) and Differential Ev...
Alberto Moraglio, Julian Togelius
PG
2002
IEEE
15 years 7 months ago
A Divide and Conquer Algorithm for Triangle Mesh Connectivity Encoding
We propose a divide and conquer algorithm for the single resolution encoding of triangle mesh connectivity. Starting from a boundary edge we grow a zig-zag strip which divides the...
Ioannis P. Ivrissimtzis, Christian Rössl, Han...
CP
1999
Springer
15 years 6 months ago
Rewriting Numeric Constraint Satisfaction Problems for Consistency Algorithms
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. ...
Claudio Lottaz
GECCO
2005
Springer
154views Optimization» more  GECCO 2005»
15 years 8 months ago
Genetic drift in univariate marginal distribution algorithm
Like Darwinian-type genetic algorithms, there also exists genetic drift in Univariate Marginal Distribution Algorithm (UMDA). Since the universal analysis of genetic drift in UMDA...
Yi Hong, Qingsheng Ren, Jin Zeng
TEC
2008
100views more  TEC 2008»
15 years 2 months ago
Real-Valued Compact Genetic Algorithms for Embedded Microcontroller Optimization
Recent research on compact genetic algorithms (cGAs) has proposed a number of evolutionary search methods with reduced memory requirements. In cGAs, the evolution of populations is...
Ernesto Mininno, Francesco Cupertino, David Naso