Sciweavers

4229 search results - page 429 / 846
» On the Optimality of Spiral Search
Sort
View
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
15 years 11 months ago
The maximum hypervolume set yields near-optimal approximation
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
Karl Bringmann, Tobias Friedrich
ICPR
2008
IEEE
16 years 1 months ago
An online polygonal approximation of digital signals and curves with Dynamic Programming algorithm
A fast online algorithm was developed for polygonal approximation of signals and curves with a minimum number of line segments for a given constraint on the standard deviation of ...
Alexander Kolesnikov
EUROGP
2007
Springer
16 years 1 months ago
On Population Size and Neutrality: Facilitating the Evolution of Evolvability
The role of population size is investigated within a neutrality induced local optima free search space. Neutrality decouples genotypic variation in evolvability from fitness varia...
Richard M. Downing
GECCO
2005
Springer
16 years 12 days ago
Probabilistic distribution models for EDA-based GP
This paper proposes a novel technique for a program evolution based on probabilistic models. In the proposed method, two probabilistic distribution models with probabilistic depen...
Kohsuke Yanai, Hitoshi Iba
GECCO
2004
Springer
127views Optimization» more  GECCO 2004»
16 years 8 days ago
Computational Complexity and Simulation of Rare Events of Ising Spin Glasses
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
Martin Pelikan, Jiri Ocenasek, Simon Trebst, Matth...