663 search results - page 5 / 133 » Algorithms for Computing Minimal Unsatisfiable Subsets of Co... |
DAC
2005
ACM
15 years 10 months ago
2005
ACM
Power minimization under variability is formulated as a rigorous statistical robust optimization program with a guarantee of power and timing yields. Both power and timing metrics...
ICIP
2004
IEEE
15 years 11 months ago
2004
IEEE
This paper presents a distortion optimized streaming algorithm for on-demand streaming of multimedia. Given the pre-encoded packets of a multimedia stream, we propose an algorithm...
MSS
2008
IEEE
14 years 9 months ago
2008
IEEE
We present the first polynomial-time algorithm for computing the minimal covering set of a (weak) tournament. The algorithm draws upon a linear programming formulation of a subset...
CAV
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We propose a novel, sound, and complete Simplex-based algorithm for solving linear inequalities over integers. Our algorithm, which can be viewed as a semantic generaliza...
PODC
2006
ACM
15 years 3 months ago
2006
ACM
A quorum system over a universe of logical elements is a collection of subsets (quorums) of elements, any two of which intersect. In numerous distributed algorithms, the elements ...