2899 search results - page 46 / 580 » Dynamic Trees in Practice |
121
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We present two important variations on a recently successful bloat control technique, Dynamic Maximum Tree Depth, intended at further improving the results and extending ...
191
click to vote
ICPP
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper presents a distributed algorithm called LREMiT for extending the lifetime of a source-based multicast tree in wireless ad hoc networks (WANET). The lifetime of a multic...
188
click to vote
COMCOM
2010
15 years 6 months ago
2010
For data-collection applications in sensor networks, it is important to ensure base station receives a complete picture about the monitored area. Convergecast is an important commu...
150
click to vote
VLDB
1992
ACM
15 years 10 months ago
1992
ACM
In the past, two basic approaches for sampling f5-om B+ trees have been suggested: sampling from the ranked trees and acceptance/rejection sampling i?om non-ranked trees. The firs...
163
click to vote
ACTA
2010
15 years 6 months ago
2010
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...