20294 search results - page 429 / 4059 » Algorithmic Information Theory |
199
click to vote
COLT
1998
Springer
15 years 12 months ago
1998
Springer
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...
194
click to vote
GECCO
2006
Springer
15 years 11 months ago
2006
Springer
This paper presents an algorithm for solving a number of generalized graph coloring problems. Specifically, it gives an agent-based algorithm for the Bandwidth Coloring problem. U...
229
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
Self-adaptation is used a lot in Evolutionary Strategies and with great success, yet for some reason it is not the mutation adaptation of choice for Genetic Algorithms. This poste...
147
click to vote
ECCC
2006
15 years 7 months ago
2006
Ant Colony Optimization (ACO) has become quite popular in recent years. In contrast to many successful applications, the theoretical foundation of this randomized search heuristic...
170
click to vote
MOC
2000
15 years 7 months ago
2000
Recently, based upon the Chen-Harker-Kanzow-Smale smoothing function and the trajectory and the neighbourhood techniques, Hotta and Yoshise proposed a noninterior point algorithm f...