738 search results - page 12 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
ICFEM
2009
Springer
14 years 7 months ago
2009
Springer
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
ISPD
2006
ACM
15 years 3 months ago
2006
ACM
In this invited note we outline several algorithms and features appearing in Capo 10, free open-source software for congestion-driven standard cell placement, mixed-size placement...
104
click to vote
ICCAD
1999
IEEE
15 years 1 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 ...
SIGECOM
2010
ACM
14 years 9 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
ISAAC
1992
Springer
15 years 1 months ago
1992
Springer
A (0,1)-matrix satisfies the consecutive ones property if there exists a column permutation such that the ones in each row of the resulting matrix are consecutive. Booth and Lueke...