Sciweavers

16188 search results - page 247 / 3238
» The Optimal PAC Algorithm
Sort
View
GECCO
2006
Springer
159views Optimization» more  GECCO 2006»
15 years 10 months ago
Credit assignment in adaptive evolutionary algorithms
In this paper, a new method for assigning credit to search operators is presented. Starting with the principle of optimizing search bias, search operators are selected based on an...
James M. Whitacre, Q. Tuan Pham, Ruhul A. Sarker
MVA
1998
230views Computer Vision» more  MVA 1998»
15 years 7 months ago
An Efficient Matching Algorithm for Segment-Based Stereo Vision Using Dynamic Programming Technique
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...
Toshio Ueshiba, Yoshihiro Kawai, Yasushi Sumi, Fum...
GECCO
2009
Springer
121views Optimization» more  GECCO 2009»
16 years 1 months ago
Evolutionary algorithms and dynamic programming
Recently, it has been proven that evolutionary algorithms produce good results for a wide range of combinatorial optimization problems. Some of the considered problems are tackled...
Benjamin Doerr, Anton Eremeev, Christian Horoba, F...
SIBGRAPI
2008
IEEE
16 years 26 days ago
A New Training Algorithm for Pattern Recognition Technique Based on Straight Line Segments
Recently, a new Pattern Recognition technique based on straight line segments (SLSs) was presented. The key issue in this new technique is to find a function based on distances b...
João Henrique Burckas Ribeiro, Ronaldo Fumi...
GECCO
2010
Springer
169views Optimization» more  GECCO 2010»
15 years 8 months ago
Stochastic local search in continuous domains: questions to be answered when designing a novel algorithm
Several population-based methods (with origins in the world of evolutionary strategies and estimation-of-distribution algorithms) for black-box optimization in continuous domains ...
Petr Posik