829 search results - page 58 / 166 » Bandit Algorithms for Tree Search |
EVOW
2009
Springer
15 years 4 months ago
2009
Springer
The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA, RNA or protein sequences while minimizing the number of evolutionary changes. Much work has been ...
IPPS
2003
IEEE
15 years 3 months ago
2003
IEEE
Clustering, or unsupervised classification, has many uses in fields that depend on grouping results from large amount of data, an example being the N-body cosmological simulation ...
102
click to vote
CONSTRAINTS
2010
14 years 9 months ago
2010
AND/OR search spaces accommodate advanced algorithmic schemes for graphical models which can exploit the structure of the model. We extend and evaluate the depth-first and best-fi...
TCAD
2002
14 years 9 months ago
2002
Abstract--This paper presents a solution to the problem of performance-driven buffered routing tree generation for VLSI circuits. Using a novel bottom-up construction algorithm and...
DASFAA
2006
IEEE
15 years 3 months ago
2006
IEEE
Keyword search is an effective approach for most users to search for information because they do not need to learn complex query languages or the underlying structures of the data....