14518 search results - page 230 / 2904 » Two Problems for Sophistication |
113
click to vote
CEC
2005
IEEE
15 years 6 months ago
2005
IEEE
Several approaches have been developed into evolutionary algorithms to deal with dynamic optimization problems, of which memory and random immigrants are two major schemes. This pa...
111
click to vote
E4MAS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Even if the multi-agent paradigm has been evolving for fifteen years, the development of concrete methods for problem solving remains a major challenge. This paper focus...
100
click to vote
EUROGP
2005
Springer
15 years 6 months ago
2005
Springer
We describe an approach to understanding evolved programs for a real world object detection problem, that of finding orthodontic landmarks in cranio-facial X-Rays. The approach in...
88
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
We reduce the approximation factor for Vertex Cover to 2 − Θ( 1√ log n ) (instead of the previous 2 − Θ(log log n log n ), obtained by Bar-Yehuda and Even [2], and by Moni...
118
click to vote
WADS
2005
Springer
15 years 6 months ago
2005
Springer
Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of...