Sciweavers

1341 search results - page 102 / 269
» Automatic Algorithm Configuration Based on Local Search
Sort
View
COLT
1998
Springer
15 years 2 months ago
Self Bounding Learning Algorithms
Most of the work which attempts to give bounds on the generalization error of the hypothesis generated by a learning algorithm is based on methods from the theory of uniform conve...
Yoav Freund
SAC
2008
ACM
14 years 9 months ago
Using the RRT algorithm to optimize classification systems for handwritten digits and letters
Multi-objective genetic algorithms have been often used to optimize classification systems, but little is discussed on their computational cost to solve such problems. This paper ...
Paulo Vinicius Wolski Radtke, Robert Sabourin, Ton...
ICPPW
2002
IEEE
15 years 3 months ago
Near-Optimal Loop Tiling by Means of Cache Miss Equations and Genetic Algorithms
The effectiveness of the memory hierarchy is critical for the performance of current processors. The performance of the memory hierarchy can be improved by means of program transf...
Jaume Abella, Antonio González, Josep Llosa...
ICRA
2003
IEEE
129views Robotics» more  ICRA 2003»
15 years 3 months ago
Optimal navigation and object finding without geometric maps or localization
In this paper we present a dynamic data structure, useful for robot navigation in an unknown, simplyconnected planar environment. The guiding philosophy in this work is to avoid t...
Benjamín Tovar, Steven M. LaValle, Rafael M...
APIN
2000
120views more  APIN 2000»
14 years 10 months ago
Two-Loop Real-Coded Genetic Algorithms with Adaptive Control of Mutation Step Sizes
Genetic algorithms are adaptive methods based on natural evolution that may be used for search and optimization problems. They process a population of search space solutions with t...
Francisco Herrera, Manuel Lozano