Sciweavers

829 search results - page 6 / 166
» Bandit Algorithms for Tree Search
Sort
View
WABI
2004
Springer
116views Bioinformatics» more  WABI 2004»
14 years 21 days ago
Topological Rearrangements and Local Search Method for Tandem Duplication Trees
—The problem of reconstructing the duplication history of a set of tandemly repeated sequences was first introduced by Fitch [4]. Many recent studies deal with this problem, show...
Denis Bertrand, Olivier Gascuel

Book
2145views
15 years 5 months ago
An Introduction to Binary Search Trees and Balanced Trees
"Libavl is a library in ANSI C for manipulation of various types of binary trees. This book provides an introduction to binary tree techniques and presents all of Libavl’s ...
Ben Pfaff
CG
2008
Springer
13 years 9 months ago
A Parallel Monte-Carlo Tree Search Algorithm
Monte-Carlo tree search is a powerful paradigm for the game of Go. We present a parallel Master-Slave algorithm for Monte-Carlo tree search. We experimented the algorithm on a netw...
Tristan Cazenave, Nicolas Jouandeau
ISCAS
2006
IEEE
94views Hardware» more  ISCAS 2006»
14 years 1 months ago
Relaxed tree search MIMO signal detection algorithm design and VLSI implementation
Abstract— This paper presents an implementation-oriented breadthfirst tree search MIMO detector design solution. Techniques at algorithm and VLSI architecture levels are develop...
Sizhong Chen, Tong Zhang, M. Goel
3DIM
2007
IEEE
14 years 1 months ago
Cached k-d tree search for ICP algorithms
The ICP (Iterative Closest Point) algorithm is the de facto standard for geometric alignment of threedimensional models when an initial relative pose estimate is available. The ba...
Andreas Nüchter, Kai Lingemann, Joachim Hertz...