1538 search results - page 215 / 308 » Spectral Techniques in Graph Algorithms |
119
click to vote
SIAMSC
2010
14 years 12 months ago
2010
The emergence of multicore architectures and highly scalable platforms motivates the development of novel algorithms and techniques that emphasize concurrency and are tolerant of ...
121
click to vote
ASWEC
2005
IEEE
15 years 7 months ago
2005
IEEE
Program slicing is a well-known program analysis technique that extracts the elements of a program related to a particular computation. Based on modular monadic semantics of a pro...
114
click to vote
APN
2004
Springer
15 years 7 months ago
2004
Springer
Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “expl...
111
click to vote
CONCUR
2003
Springer
15 years 6 months ago
2003
Springer
We propose an algorithm for generating a Priority Rewrite System (PRS) for an arbitrary process language in the OSOS format such that rewriting of process terms is sound for bisim...
117
click to vote
DAC
2005
ACM
15 years 3 months ago
2005
ACM
Layout parasitics have great impact on analog circuit performance. This paper presents an algorithm for explicit parasitic control during layout retargeting of analog integrated c...