Sciweavers

725 search results - page 12 / 145
» Smoothed Analysis of Algorithms and Heuristics
Sort
View
ICRA
2002
IEEE
97views Robotics» more  ICRA 2002»
15 years 2 months ago
Obstacle Detection in Smooth High Curvature Terrain
Detection of obstacles for autonomous vehicles is more difficult when the terrain is not locally planar and remains an open problem. We have developed an approach suited for obsta...
Parag H. Batavia, Sanjiv Singh
ECML
2004
Springer
15 years 3 months ago
An Analysis of Stopping and Filtering Criteria for Rule Learning
Abstract. In this paper, we investigate the properties of commonly used prepruning heuristics for rule learning by visualizing them in PN-space. PN-space is a variant of ROC-space,...
Johannes Fürnkranz, Peter A. Flach
COR
2010
146views more  COR 2010»
14 years 10 months ago
A search space "cartography" for guiding graph coloring heuristics
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
15 years 4 months ago
On the runtime analysis of the 1-ANT ACO algorithm
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carst...
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
14 years 11 months ago
Computing minimum cuts by randomized search heuristics
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Frank Neumann, Joachim Reichel, Martin Skutella