48 search results - page 5 / 10 » Experimental Supplements to the Theoretical Analysis of EAs ... |
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...
SETA
2004
Springer
14 years 24 days ago
2004
Springer
A classical problem of digital sequence design, first studied in the 1950s but still not well understood, is to determine those binary sequences whose aperiodic autocorrelations ...
MFCS
2001
Springer
13 years 12 months ago
2001
Springer
In the traveling repairman problem (Trp), a tour must be found through every one of a set of points (cities) in some metric space such that the weighted sum of completion times of ...
WEA
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
MEMETIC
2010
13 years 2 months ago
2010
In combinatorial solution spaces Iterated Local Search (ILS) turns out to be exceptionally successful. The question arises: is ILS also capable of improving the optimization proces...