596 search results - page 102 / 120 » Complexity Analysis by Graph Rewriting |
RSP
1999
IEEE
15 years 4 months ago
1999
IEEE
Though synchronous dataflow (SDF) graph has been a successful input specification language for digital signal processing (DSP) applications, lack of support for global states makes...
161
click to vote
FOCS
1997
IEEE
15 years 4 months ago
1997
IEEE
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
106
click to vote
CHI
1996
ACM
15 years 3 months ago
1996
ACM
In its current implementation, the World-Wide Web lacks much of the explicit structure and strong typing found in many closed hypertext systems. While this property has directly f...
104
click to vote
CP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
ATVA
2004
Springer
15 years 3 months ago
2004
Springer
While model checking suffers from the state space explosion problem, theorem proving is quite tedious and impractical for verifying complex designs. In this work, we present a veri...