Sciweavers

3359 search results - page 176 / 672
» A Simplified Idea Algorithm
Sort
View
ICS
2010
Tsinghua U.
16 years 1 months ago
Distribution-Specific Agnostic Boosting
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
Vitaly Feldman
CEC
2008
IEEE
15 years 11 months ago
Multi-level neutrality in optimization
Abstract— This paper explores the idea of neutrality in heuristic optimization algorithms. In particular, the effect of having multiple levels of neutrality in representations is...
Colin G. Johnson
WAOA
2004
Springer
142views Algorithms» more  WAOA 2004»
15 years 9 months ago
This Side Up!
Abstract. We consider two- and three-dimensional bin packing problems where 90◦ rotations are allowed. We improve all known asymptotic performance bounds for these problems. In p...
Leah Epstein, Rob van Stee
HUMO
2000
Springer
15 years 8 months ago
Robust Head Motion Computation by Taking Advantage of Physical Properties
We present a new algorithm to compute the head motion between two views from the correspondences of five feature points (eye corners, mouth corners, and nose top), and zero or mor...
Zicheng Liu, Zhengyou Zhang
AAAI
2008
15 years 6 months ago
Potential-based Shaping in Model-based Reinforcement Learning
Potential-based shaping was designed as a way of introducing background knowledge into model-free reinforcement-learning algorithms. By identifying states that are likely to have ...
John Asmuth, Michael L. Littman, Robert Zinkov