Sciweavers

2899 search results - page 16 / 580
» Dynamic Trees in Practice
Sort
View
FM
2009
Springer
110views Formal Methods» more  FM 2009»
14 years 3 months ago
Reduced Execution Semantics of MPI: From Theory to Practice
Abstract: There is growing need to develop formal verification tools for Message Passing Interface (MPI) programs, to eliminate bugs such as deadlocks and local assertion violatio...
Sarvani S. Vakkalanka, Anh Vo, Ganesh Gopalakrishn...
DAC
2004
ACM
14 years 9 months ago
Theoretical and practical limits of dynamic voltage scaling
Bo Zhai, David Blaauw, Dennis Sylvester, Kriszti&a...
DATESO
2009
101views Database» more  DATESO 2009»
13 years 6 months ago
Using Top Trees For Easy Programming of Tree Algorithms
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
Michal Vajbar
PODS
2002
ACM
111views Database» more  PODS 2002»
14 years 8 months ago
Labeling Dynamic XML Trees
Edith Cohen, Haim Kaplan, Tova Milo
CONSTRAINTS
2008
90views more  CONSTRAINTS 2008»
13 years 8 months ago
Combining Tree Partitioning, Precedence, and Incomparability Constraints
The tree constraint partitions a directed graph into node-disjoint trees. In many practical applications that involve such a partition, there exist side constraints specifying requ...
Nicolas Beldiceanu, Pierre Flener, Xavier Lorca