829 search results - page 90 / 166 » Bandit Algorithms for Tree Search |
ISCC
2006
IEEE
15 years 3 months ago
2006
IEEE
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
CIKM
2005
Springer
15 years 3 months ago
2005
Springer
A framework for describing semantic relationships among nodes in XML documents is presented. In contrast to earlier work, the XML documents may have ID references (i.e., they corr...
CPAIOR
2010
Springer
15 years 2 months ago
2010
Springer
Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algo...
NIPS
2007
14 years 11 months ago
2007
We present a general boosting method extending functional gradient boosting to optimize complex loss functions that are encountered in many machine learning problems. Our approach...
ICCS
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. The Evolutionary Geometric Near-neighbor Access Tree (EGNAT) is a recently proposed data structure that is suitable for indexing large collections of complex objects. It ...