829 search results - page 124 / 166 » Bandit Algorithms for Tree Search |
CPAIOR
2010
Springer
15 years 2 months ago
2010
Springer
We introduce an approach which combines ACO (Ant Colony Optimization) and IBM ILOG CP Optimizer for solving COPs (Combinatorial Optimization Problems). The problem is modeled using...
ECML
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. This paper proposes a generic extension to propositional rule learners to handle multiple-instance data. In a multiple-instance representation, each learning example is r...
CAAN
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. Helsgaun has introduced and implemented the lower tolerances (-values) for an approximation of Held-Karp's 1-tree with the purpose to improve the Lin-Kernighan Heuri...
CIAC
2006
Springer
15 years 1 months ago
2006
Springer
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...
EMNLP
2007
14 years 11 months ago
2007
We present a data-driven variant of the LR algorithm for dependency parsing, and extend it with a best-first search for probabilistic generalized LR dependency parsing. Parser act...