234 search results - page 27 / 47 » An Introduction to Binary Search Trees and Balanced Trees |
INFOSCALE
2007
ACM
14 years 11 months ago
2007
ACM
Efficient multi-dimensional data search has received much attention in centralized systems. However, its implementation in large-scale distributed systems is not a trivial job and...
SAC
2010
ACM
15 years 4 months ago
2010
ACM
This article addresses the problem of efficient multi-robot patrolling in a known environment. The proposed approach assigns regions to each mobile agent. Every region is represen...
86
Voted
GLOBECOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— In wireless ad hoc networks (WANETs), e.g. wireless sensor networks, battery-powered devices are constrained by limited amount of energy. Many WANET applications require that t...
CPC
1999
14 years 9 months ago
1999
Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...
194
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
We have developed a system to process database queries over composed data providing web services. The queries are transformed into execution plans containing an operator that invok...