Sciweavers

829 search results - page 12 / 166
» Bandit Algorithms for Tree Search
Sort
View
SWAT
1994
Springer
126views Algorithms» more  SWAT 1994»
13 years 11 months ago
Optimal Parametric Search on Graphs of Bounded Tree-Width
We give linear-time algorithms for a class of parametric search problems on weighted graphs of bounded tree-width. We also discuss the implications of our results to approximate p...
David Fernández-Baca, Giora Slutzki
WABI
2005
Springer
120views Bioinformatics» more  WABI 2005»
14 years 26 days ago
A Compressed Format for Collections of Phylogenetic Trees and Improved Consensus Performance
Phylogenetic tree searching algorithms often produce thousands of trees which biologists save in Newick format in order to perform further analysis. Unfortunately, Newick is neithe...
Robert S. Boyer, Warren A. Hunt Jr., Serita M. Nel...
CPAIOR
2005
Springer
14 years 28 days ago
Nondeterministic Control for Hybrid Search
Hybrid algorithms combining local and systematic search often use nondeterminism in fundamentally different ways. They may differ in the strategy to explore the search tree and/o...
Pascal Van Hentenryck, Laurent Michel
APBC
2004
154views Bioinformatics» more  APBC 2004»
13 years 8 months ago
Dispensation Order Generation for Pyrosequencing
This article describes a dispensation order generation algorithm for genotyping using the Pyrosequencing method. The input template of the algorithm is a slightly restricted regul...
Mats Carlsson, Nicolas Beldiceanu
CISS
2008
IEEE
14 years 1 months ago
Memory-constrained ML-optimal tree search detection
— In this paper, we propose a memory-constrained tree search (MCTS) algorithm for the detection in multiple-input multiple-output (MIMO) systems. The MCTS algorithm offers a wide...
Yongmei Dai, Zhiyuan Yan