Sciweavers

1503 search results - page 3 / 301
» Self-optimizing distributed trees
Sort
View
CORR
2011
Springer
215views Education» more  CORR 2011»
13 years 9 days ago
The total path length of split trees
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
Nicolas Broutin, Cecilia Holmgren
DAM
2010
101views more  DAM 2010»
13 years 5 months ago
On the distribution of distances between specified nodes in increasing trees
We study the quantity distance between node j and node n in a random tree of size n for increasing tree families. We give closed formul
Markus Kuba, Alois Panholzer
CORR
2011
Springer
183views Education» more  CORR 2011»
12 years 9 months ago
Learning When Training Data are Costly: The Effect of Class Distribution on Tree Induction
For large, real-world inductive learning problems, the number of training examples often must be limited due to the costs associated with procuring, preparing, and storing the tra...
Foster J. Provost, Gary M. Weiss
CP
2011
Springer
12 years 5 months ago
Pseudo-Tree-Based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...
Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Mako...