Sciweavers

3 search results - page 1 / 1
» Geometric Nelder-Mead Algorithm for the permutation represen...
Sort
View
CEC
2010
IEEE
13 years 6 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
GECCO
2011
Springer
270views Optimization» more  GECCO 2011»
12 years 8 months ago
Geometric surrogate-based optimisation for permutation-based problems
In continuous optimisation, surrogate models (SMs) are used when tackling real-world problems whose candidate solutions are expensive to evaluate. In previous work, we showed that...
Alberto Moraglio, Yong-Hyuk Kim, Yourim Yoon
SWAT
1994
Springer
113views Algorithms» more  SWAT 1994»
13 years 9 months ago
Trapezoid Graphs and Generalizations, Geometry and Algorithms
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan, Golumbic and Pinter DGP]. Th...
Stefan Felsner, Rudolf Müller, Lorenz Wernisc...