Sciweavers

3055 search results - page 81 / 611
» Randomized Search Trees
Sort
View
AAAI
2010
13 years 11 months ago
Understanding the Success of Perfect Information Monte Carlo Sampling in Game Tree Search
Perfect Information Monte Carlo (PIMC) search is a practical technique for playing imperfect information games that are too large to be optimally solved. Although PIMC search has ...
Jeffrey Richard Long, Nathan R. Sturtevant, Michae...
CVIU
2011
13 years 5 months ago
Action recognition with appearance-motion features and fast search trees
In this paper we propose an approach for action recognition based on a vocabulary of local motion-appearance features and fast approximate search in a large number of trees. Large...
Krystian Mikolajczyk, Hirofumi Uemura
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
14 years 11 months ago
Similarity Search in Sets and Categorical Data Using the Signature Tree
Data mining applications analyze large collections of set data and high dimensional categorical data. Search on these data types is not restricted to the classic problems of minin...
Nikos Mamoulis, David W. Cheung, Wang Lian
WWW
2008
ACM
14 years 11 months ago
Genealogical trees on the web: a search engine user perspective
This paper presents an extensive study about the evolution of textual content on the Web, which shows how some new pages are created from scratch while others are created using al...
Ricardo A. Baeza-Yates, Álvaro R. Pereira J...
CG
2008
Springer
14 years 8 days 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...