1951 search results - page 115 / 391 » An algorithm for improving graph partitions |
134
click to vote
SPIN
2009
Springer
15 years 11 months ago
2009
Springer
This paper introduces a new model checking algorithm that searches for non-progress cycles, used mainly to check for livelocks. The algorithm performs an incremental depth-first s...
143
click to vote
DAC
2004
ACM
16 years 5 months ago
2004
ACM
Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some human-designed ar...
138
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: Extensive and automated data integration in bioinformatics facilitates the construction of large, complex biological networks. However, the challenge lies in the inter...
163
click to vote
OPODIS
2001
15 years 5 months ago
2001
In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhan...
155
click to vote
ASPDAC
2012
ACM
14 years 6 days ago
2012
ACM
Behavioral synthesis tools have made significant progress in compiling high-level programs into register-transfer level (RTL) specifications. But manually rewriting code is still ...