Sciweavers

2899 search results - page 127 / 580
» Dynamic Trees in Practice
Sort
View
ISCAS
2005
IEEE
138views Hardware» more  ISCAS 2005»
14 years 2 months ago
Transition time bounded low-power clock tree construction
— Recently power becomes a significant issue in clock network design for high-performance ICs because the clock network consumes a large portion of the total power in the whole s...
Min Pan, Chris C. N. Chu, J. Morris Chang
IWMM
2000
Springer
105views Hardware» more  IWMM 2000»
14 years 19 days ago
Diffusion Tree Restructuring for Indirect Reference Counting
A new variant algorithm for distributed acyclic garbage detection is presented for use in hybrid garbage collectors. The existing fault-tolerance of Piquer's Indirect Referen...
Peter Dickman
CONCUR
2006
Springer
13 years 11 months ago
Model Checking Quantified Computation Tree Logic
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
Arend Rensink
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
14 years 1 months ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla
CORR
2004
Springer
151views Education» more  CORR 2004»
13 years 9 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...