Sciweavers

1376 search results - page 28 / 276
» Searching Trees: An Essay
Sort
View
CG
2008
Springer
15 years 1 months ago
Monte-Carlo Tree Search Solver
Recently, Monte-Carlo Tree Search (MCTS) has advanced the field of computer Go substantially. In this article we investigate the application of MCTS for the game Lines of Action (L...
Mark H. M. Winands, Yngvi Björnsson, Jahn-Tak...
SWAT
1992
Springer
147views Algorithms» more  SWAT 1992»
15 years 3 months ago
Efficient Rebalancing of Chromatic Search Trees
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
Joan Boyar, Kim S. Larsen
EMNLP
2011
13 years 11 months ago
Heuristic Search for Non-Bottom-Up Tree Structure Prediction
State of the art Tree Structures Prediction techniques rely on bottom-up decoding. These approaches allow the use of context-free features and bottom-up features. We discuss the l...
Andrea Gesmundo, James Henderson
ANOR
2002
128views more  ANOR 2002»
14 years 11 months ago
Crew Assignment via Constraint Programming: Integrating Column Generation and Heuristic Tree Search
The Airline Crew Assignment Problem (ACA) consists of assigning lines of work to a set of crew members such that a set of activities is partitioned and the costs for that assignmen...
Meinolf Sellmann, Kyriakos Zervoudakis, Panagiotis...
CG
2010
Springer
14 years 9 months ago
Scalability and Parallelization of Monte-Carlo Tree Search
Monte-Carlo Tree Search is now a well established algorithm, in games and beyond. We analyze its scalability, and in particular its limitations, and the implications in terms of pa...
Amine Bourki, Guillaume Chaslot, Matthieu Coulm, V...