Sciweavers

2899 search results - page 46 / 580
» Dynamic Trees in Practice
Sort
View
GECCO
2004
Springer
14 years 2 months ago
Dynamic Limits for Bloat Control: Variations on Size and Depth
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 ...
Sara Silva, Ernesto Costa
ICPP
2003
IEEE
14 years 2 months ago
On Maximizing Lifetime of Multicast Trees in Wireless Ad hoc Networks
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...
Bin Wang, Sandeep K. S. Gupta
COMCOM
2010
276views more  COMCOM 2010»
13 years 9 months ago
Adjustable convergecast tree protocol for wireless sensor networks
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...
Tzung-Shi Chen, Hua-Wen Tsai, Chih-Ping Chu
VLDB
1992
ACM
137views Database» more  VLDB 1992»
14 years 26 days ago
Random Sampling from Pseudo-Ranked B+ Trees
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...
Gennady Antoshenkov
ACTA
2010
191views more  ACTA 2010»
13 years 9 months ago
Automata-based verification of programs with tree updates
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
Peter Habermehl, Radu Iosif, Tomás Vojnar