Sciweavers

3055 search results - page 451 / 611
» Randomized Search Trees
Sort
View
COLT
2008
Springer
15 years 6 months ago
An Efficient Reduction of Ranking to Classification
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
Nir Ailon, Mehryar Mohri
SCAI
2008
15 years 6 months ago
Towards Automatic Model Generation by Optimization
The problem of automatically selecting simulation models for autonomous agents depending on their current intentions and beliefs is considered in this paper. The intended use of t...
Per Nyblom, Patrick Doherty
IJCAI
2001
15 years 5 months ago
Balance and Filtering in Structured Satisfiable Problems
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
Henry A. Kautz, Yongshao Ruan, Dimitris Achlioptas...
GECCO
2008
Springer
141views Optimization» more  GECCO 2008»
15 years 5 months ago
A study of NK landscapes' basins and local optima networks
We propose a network characterization of combinatorial fitness landscapes by adapting the notion of inherent networks proposed for energy surfaces [5]. We use the well-known fami...
Gabriela Ochoa, Marco Tomassini, Sébastien ...
GECCO
2008
Springer
324views Optimization» more  GECCO 2008»
15 years 5 months ago
Convergence behavior of the fully informed particle swarm optimization algorithm
The fully informed particle swarm optimization algorithm (FIPS) is very sensitive to changes in the population topology. The velocity update rule used in FIPS considers all the ne...
Marco Antonio Montes de Oca, Thomas Stützle