Sciweavers

240 search results - page 13 / 48
» Efficient Variants of the Backward-Oracle-Matching Algorithm
Sort
View
STOC
2003
ACM
154views Algorithms» more  STOC 2003»
14 years 9 months ago
Boosting in the presence of noise
Boosting algorithms are procedures that "boost" low-accuracy weak learning algorithms to achieve arbitrarily high accuracy. Over the past decade boosting has been widely...
Adam Kalai, Rocco A. Servedio
COLT
1994
Springer
14 years 21 days ago
Efficient Reinforcement Learning
Realistic domains for learning possess regularities that make it possible to generalize experience across related states. This paper explores an environment-modeling framework tha...
Claude-Nicolas Fiechter
EMO
2006
Springer
173views Optimization» more  EMO 2006»
14 years 8 days ago
Differential Evolution versus Genetic Algorithms in Multiobjective Optimization
This paper presents a comprehensive comparison between the performance of state-of-the-art genetic algorithms NSGA-II, SPEA2 and IBEA and their differential evolution based variant...
Tea Tusar, Bogdan Filipic
ESANN
2008
13 years 10 months ago
On related violating pairs for working set selection in SMO algorithms
Sequential Minimal Optimization (SMO) is currently the most popular algorithm to solve large quadratic programs for Support Vector Machine (SVM) training. For many variants of this...
Tobias Glasmachers
CORR
2006
Springer
98views Education» more  CORR 2006»
13 years 8 months ago
Faster Algorithms for Constructing a Concept (Galois) Lattice
In this paper, we present a fast algorithm for constructing a concept (Galois) lattice of a binary relation, including computing all concepts and their lattice order. We also prese...
Vicky Choi