Sciweavers

310 search results - page 59 / 62
» Randomized Binary Search Trees
Sort
View
WEA
2009
Springer
139views Algorithms» more  WEA 2009»
14 years 5 months ago
Fast Algorithm for Graph Isomorphism Testing
Abstract. In this paper we present a novel approach to the graph isomorphism problem. We combine a direct approach, that tries to find a mapping between the two input graphs using...
José Luis López-Presa, Antonio Fern&...
ACG
2009
Springer
14 years 5 months ago
Evaluation Function Based Monte-Carlo LOA
Recently, Monte-Carlo Tree Search (MCTS) has advanced the field of computer Go substantially. In the game of Lines of Action (LOA), which has been dominated in the past by αβ, M...
Mark H. M. Winands, Yngvi Björnsson
UAI
2004
14 years 6 days ago
A Complete Anytime Algorithm for Treewidth
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
Vibhav Gogate, Rina Dechter
IJRR
2011
174views more  IJRR 2011»
13 years 5 months ago
Bounding on rough terrain with the LittleDog robot
— In this paper we develop an RRT-based motion planner that achieved bounding in simulation with the LittleDog robot over extremely rough terrain. LittleDog is a quadruped robot ...
Alexander C. Shkolnik, Michael Levashov, Ian R. Ma...
BMCBI
2008
201views more  BMCBI 2008»
13 years 11 months ago
A copula method for modeling directional dependence of genes
Background: Genes interact with each other as basic building blocks of life, forming a complicated network. The relationship between groups of genes with different functions can b...
Jong-Min Kim, Yoon-Sung Jung, Engin A. Sungur, Kap...