1830 search results - page 111 / 366 » Workshop on Graph Computation Models |
164
click to vote
ICCAD
1999
IEEE
15 years 8 months ago
1999
IEEE
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
119
click to vote
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper presents an efficient modeling scheme and a partitioning heuristic for parallelizing VLSI post-placement timing optimization. Encoding the paths with timing violations...
139
click to vote
ASAP
2010
IEEE
15 years 6 months ago
2010
IEEE
Data-flow has proven to be an attractive computation model for programming digital signal processing (DSP) applications. A restricted version of data-flow, termed synchronous data...
171
click to vote
VL
2000
IEEE
15 years 8 months ago
2000
IEEE
This paper outlines DIAPLAN, a visual rule-based programming language and environment that is based on the computational model of graph transformation. Thanks to its genericity, D...
125
click to vote
WDAG
1989
Springer
15 years 8 months ago
1989
Springer
We focus on unreliable asynchronous shared memory model which support only atomic read and write operations. For such a model we provide a necessary condition for the solvability ...