829 search results - page 114 / 166 » Bandit Algorithms for Tree Search |
DAC
2005
ACM
15 years 10 months ago
2005
ACM
This paper presents a novel repeater insertion algorithm for the power minimization of realistic interconnect trees under given timing budgets. Our algorithm judiciously combines ...
KDD
2009
ACM
15 years 10 months ago
2009
ACM
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
111
click to vote
ILP
2007
Springer
15 years 3 months ago
2007
Springer
In this chapter, we describe a view of statistical learning in the inductive logic programming setting based on kernel methods. The relational representation of data and background...
WABI
2001
Springer
15 years 2 months ago
2001
Springer
We derive a branch-and-bound algorithm to find an optimal inversion median of three signed permutations. The algorithm prunes to manageable size an extremely large search tree usi...
109
click to vote
IPPS
1999
IEEE
15 years 2 months ago
1999
IEEE
We investigate the average-case speed and scalability of parallel algorithms executing on multiprocessors. Our performance metrics are average-speed and isospeed scalability. By m...