9532 search results - page 316 / 1907 » Logic, Graphs, and Algorithms |
178
click to vote
AAIM
2010
Springer
15 years 10 months ago
2010
Springer
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of...
189
click to vote
CAV
2009
Springer
16 years 7 months ago
2009
Springer
We present the key ideas in the design and implementation of Beaver, an SMT solver for quantifier-free finite-precision bit-vector logic (QF BV). Beaver uses an eager approach, enc...
180
click to vote
ICCD
2002
IEEE
16 years 3 months ago
2002
IEEE
Boolean functions are fundamental to synthesis and verification of digital logic, and compact representations of Boolean functions have great practical significance. Popular repre...
177
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
182
click to vote
HPCC
2007
Springer
16 years 25 days ago
2007
Springer
The OTIS-Network (also referred to as two-level swapped network) is composed of n clones of an n-node original network constituting its clusters. It has received much attention due...