4469 search results - page 647 / 894 » Dynamic Program Slicing |
110
click to vote
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...
WIA
1997
Springer
15 years 6 months ago
1997
Springer
We show how LR parsers for the analysis of arbitrary context-free grammars can be derived from classical Earley's parsing algorithm. The result is a Generalized LR parsing al...
118
click to vote
RTSS
1995
IEEE
15 years 6 months ago
1995
IEEE
We present a scheme to guarantee that the execution of real-time tasks can tolerate transient and intermittent faults assuming any queue- based scheduling technique. The scheme is...
148
Voted
DOOD
1991
Springer
15 years 6 months ago
1991
Springer
This paper examines the problem of adding non-deterministic constructs to a declarative database language based on Horn Clause Logic. We revise a previously proposed approach, the...
109
click to vote
INFOCOM
1991
IEEE
15 years 6 months ago
1991
IEEE
We have designed and implemented three multicast path finding algorithms for networks with directed links: an optimal algorithm based on the dynamic programming technique, a heuri...