3220 search results - page 295 / 644 » Constrained Graph Processes |
187
click to vote
DAC
2004
ACM
16 years 1 days ago
2004
ACM
—This paper proposes a novel approach to the exact symbolic analysis of very large analog circuits. The new method is based on determinant decision diagrams (DDDs) representing s...
182
click to vote
ICSM
2003
IEEE
15 years 12 months ago
2003
IEEE
This paper is a summary of the author’s thesis that presents a model and an environment for recovering the high level design of legacy software systems based on user defined ar...
195
click to vote
CONCUR
2006
Springer
15 years 10 months ago
2006
Springer
Event structures have been used for giving true concurrent semantics to languages and models of concurrency such as CCS, Petri nets and graph grammars. Although certain nominal cal...
176
click to vote
AVI
2008
15 years 7 months ago
2008
Programming assignments are easy to plagiarize in such a way as to foil casual reading by graders. Graders can resort to automatic plagiarism detection systems, which can generate...
174
click to vote
CCR
2004
15 years 6 months ago
2004
At the inter-domain level, the Internet topology can be represented by a graph with Autonomous Systems (ASes) as nodes and AS peerings as links. This AS-level topology graph has b...