610 search results - page 22 / 122 » Solving Geometrical Place Problems by using Evolutionary Alg... |
115
Voted
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
In order to solve nonstationary optimization problems efficiently, evolutionary algorithms need sufficient diversity to adapt to environmental changes. The dual-population genetic...
117
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, re...
139
click to vote
CEC
2008
IEEE
15 years 10 months ago
2008
IEEE
— In this paper, a multi-agent based evolutionary algorithm (MAEA) is introduced to solve dynamic optimization problems. The agents simulate living organism features and co-evolv...
310
Voted
FAW
2010
Springer
15 years 4 months ago
2010
Springer
We study problems in computational geometry from the viewpoint of adaptive algorithms. Adaptive algorithms have been extensively studied for the sorting problem, and in this paper ...
116
Voted
DCOSS
2009
Springer
15 years 10 months ago
2009
Springer
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...