1182 search results - page 87 / 237 » Iterative Methods in Combinatorial Optimization |
109
click to vote
NIPS
2001
15 years 4 months ago
2001
We give an unified convergence analysis of ensemble learning methods including e.g. AdaBoost, Logistic Regression and the Least-SquareBoost algorithm for regression. These methods...
125
click to vote
ECCV
2010
Springer
15 years 1 months ago
2010
Springer
Sturm-Triggs iteration is a standard method for solving the projective factorization problem. Like other iterative algorithms, this method suffers from some common drawbacks such ...
111
Voted
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
The Cross Entropy algorithm is a new search method for combinatorial problem. However, it needs considerable computational time to achieve good solution quality. To make the Cross...
116
click to vote
GECCO
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. This paper proposes an algorithm for combinatorial optimizations that uses reinforcement learning and estimation of joint probability distribution of promising solutions ...
130
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Recently there has been a growing interest of research in tabling in the logic programming community because of its usefulness in a variety of application domains including progra...