Sciweavers

1376 search results - page 20 / 276
» Searching Trees: An Essay
Sort
View
JPDC
2002
104views more  JPDC 2002»
14 years 11 months ago
Fully dynamic distributed search trees can be balanced in O(lg2 N) time
In this paper we consider the dictionary problem in a message-passing distributed environment. We introduce a new version, based on AVL-trees, of distributed search trees, the fir...
Fabio Barillari, Enrico Nardelli, Massimo Pepe
ISCAS
2006
IEEE
94views Hardware» more  ISCAS 2006»
15 years 5 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
AIIDE
2008
15 years 2 months ago
Monte-Carlo Tree Search: A New Framework for Game AI
Classic approaches to game AI require either a high quality of domain knowledge, or a long time to generate effective AI behaviour. These two characteristics hamper the goal of es...
Guillaume Chaslot, Sander Bakkes, Istvan Szita, Pi...
SIAMCOMP
2002
139views more  SIAMCOMP 2002»
14 years 11 months ago
Limit Laws for Sums of Functions of Subtrees of Random Binary Search Trees
We consider sums of functions of subtrees of a random binary search tree, and obtain general laws of large numbers and central limit theorems. These sums correspond to random recur...
Luc Devroye
ALGORITHMICA
2011
14 years 6 months ago
An Approximation Algorithm for Binary Searching in Trees
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
Eduardo Sany Laber, Marco Molinaro