Sciweavers

663 search results - page 5 / 133
» Algorithms for Computing Minimal Unsatisfiable Subsets of Co...
Sort
View
DAC
2005
ACM
14 years 8 months ago
An efficient algorithm for statistical minimization of total power under timing yield constraints
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...
Murari Mani, Anirudh Devgan, Michael Orshansky
ICIP
2004
IEEE
14 years 9 months ago
Distortion-buffer optimized tcp video streaming
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...
Anshul Sehgal, Olivier Verscheure, Pascal Frossard
MSS
2008
IEEE
118views Hardware» more  MSS 2008»
13 years 7 months ago
Computing the minimal covering set
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...
Felix Brandt, Felix A. Fischer
CAV
2009
Springer
218views Hardware» more  CAV 2009»
14 years 8 months ago
Cuts from Proofs: A Complete and Practical Technique for Solving Linear Inequalities over Integers
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...
Isil Dillig, Thomas Dillig, Alex Aiken
PODC
2006
ACM
14 years 1 months ago
Quorum placement in networks: minimizing network congestion
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 ...
Daniel Golovin, Anupam Gupta, Bruce M. Maggs, Flor...