829 search results - page 68 / 166 » Bandit Algorithms for Tree Search |
ICIP
2004
IEEE
15 years 11 months ago
2004
IEEE
This paper presents an object recognition method that exploits the representation of the images obtained by means of a Binary Partition Tree (BPT). The shape matching technique in...
ISCAS
2003
IEEE
15 years 3 months ago
2003
IEEE
– The traditional way of approaching placement problems in computer-aided design (CAD) tools for analog layout is to explore an extremely large search space of feasible or unfeas...
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
This paper formalizes Feature Selection as a Reinforcement Learning problem, leading to a provably optimal though intractable selection policy. As a second contribution, this pape...
KDD
2000
ACM
15 years 1 months ago
2000
ACM
Decision trees have been successfully used for the task of classification. However, state-of-the-art algorithms do not incorporate the user in the tree construction process. This ...
AI
2006
Springer
14 years 9 months ago
2006
Springer
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...