2899 search results - page 155 / 580 » Dynamic Trees in Practice |
102
Voted
ICALP
1999
Springer
15 years 7 months ago
1999
Springer
The data sets for many of today's computer applications are too large to t within the computer's internal memory and must instead be stored on external storage devices su...
114
Voted
ICCAD
1995
IEEE
15 years 6 months ago
1995
IEEE
: We study the minimum-cost bounded-skew routing tree problem under the Elmore delay model. We presenttwo approachesto construct bounded-skew routing trees: (i) the Boundary Mergin...
113
Voted
FMOODS
2007
15 years 4 months ago
2007
We present the first tool that offers dynamic verification of extended traints on UML models. It translates a UML model into an Abstract State (ASM) which is transformed by an AS...
125
Voted
TON
2002
15 years 2 months ago
2002
Abstract--This paper addresses multicast routing in circuitswitched multihop optical networks employing wavelength-division multiplexing. We consider a model in which multicast com...
144
Voted
C3S2E
2010
ACM
15 years 3 months ago
2010
ACM
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...