10 search results - page 1 / 2 » Boosting Combinatorial Search Through Randomization |
AAAI
1998
13 years 6 months ago
1998
Unpredictability in the running time of complete search procedures can often be explained by the phenomenon of "heavy-tailed cost distributions", meaning that at any tim...
ANOR
2004
13 years 4 months ago
2004
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
ICTAI
2009
IEEE
13 years 2 months ago
2009
IEEE
We propose a framework which we call stochastic offline programming (SOP). The idea is to embed the development of combinatorial algorithms in an off-line learning environment whi...
CVPR
2008
IEEE
14 years 6 months ago
2008
IEEE
The selection of weak classifiers is critical to the success of boosting techniques. Poor weak classifiers do not perform better than random guess, thus cannot help decrease the t...
AIRWEB
2007
Springer
13 years 11 months ago
2007
Springer
Link spam deliberately manipulates hyperlinks between web pages in order to unduly boost the search engine ranking of one or more target pages. Link based ranking algorithms such ...