Sciweavers

285 search results - page 9 / 57
» New Ways to Construct Binary Search Trees
Sort
View
98
Voted
METMBS
2004
140views Mathematics» more  METMBS 2004»
15 years 1 months ago
New Techniques for Generation and Analysis of Evolutionary Trees
We introduce new distance measures for the construction and analysis of phylogenies, focusing on thioredoxin-fold proteins. Our distance measures for tree construction are based o...
Chang Wang, Stephen D. Scott, Qingping Tao, Dmitri...
89
Voted
PKDD
2000
Springer
134views Data Mining» more  PKDD 2000»
15 years 3 months ago
Induction of Multivariate Decision Trees by Using Dipolar Criteria
A new approach to the induction of multivariate decision trees is proposed. A linear decision function (hyper-plane) is used at each non-terminal node of a binary tree for splittin...
Leon Bobrowski, Marek Kretowski
81
Voted
CG
2008
Springer
15 years 1 months ago
Parallel Monte-Carlo Tree Search
Monte-Carlo Tree Search (MCTS) is a new best-first search method that started a revolution in the field of Computer Go. Parallelizing MCTS is an important way to increase the stren...
Guillaume Chaslot, Mark H. M. Winands, H. Jaap van...
106
Voted
JFP
2006
113views more  JFP 2006»
14 years 11 months ago
Efficient manipulation of binary data using pattern matching
Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This article presents an appr...
Per Gustafsson, Konstantinos F. Sagonas
CORR
2010
Springer
174views Education» more  CORR 2010»
14 years 11 months ago
Gaussian Process Bandits for Tree Search
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
Louis Dorard, John Shawe-Taylor