Sciweavers

4 search results - page 1 / 1
» Typical properties of winners and losers in discrete optimiz...
Sort
View
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 5 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
SASO
2009
IEEE
13 years 11 months ago
Controlling Particle Swarm Optimization with Learned Parameters
—Controlling particle swarm optimization is typically an unintuitive task, involving a process of adjusting low-level parameters of the system that often do not have obvious corr...
Kevin Winner, Don Miner, Marie desJardins
SASO
2009
IEEE
13 years 11 months ago
Self-Organization of Patrolling-Ant Algorithms
—We consider here multi-agent patrolling as the task for a group of agents to repeatedly visit all the cells of a discrete environment. Wagner et al. [1] have introduced patrolli...
Arnaud Glad, Olivier Buffet, Olivier Simonin, Fran...
GECCO
2003
Springer
123views Optimization» more  GECCO 2003»
13 years 10 months ago
Benefits of Implicit Redundant Genetic Algorithms for Structural Damage Detection in Noisy Environments
A robust structural damage detection method that can handle noisy frequency response function information is discussed. The inherent unstructured nature of damage detection problem...
Anne M. Raich, Tamás Liszkai