2714 search results - page 120 / 543 » Approximation Schemes for Scheduling |
122
click to vote
SIBGRAPI
2008
IEEE
15 years 7 months ago
2008
IEEE
This work proposes a simple approximation scheme for discrete data that leads to an infinitely smooth result without global optimization. It combines the flexibility of Binary Sp...
ICASSP
2010
IEEE
15 years 26 days ago
2010
IEEE
We consider trellis-based algorithms for data estimation in digital communication systems. We present a general framework which includes approximate Viterbi algorithms like the M-...
129
click to vote
CP
2008
Springer
15 years 2 months ago
2008
Springer
In this paper, we describe a new algorithm for sampling solutions from a uniform distribution over the solutions of a constraint network. Our new algorithm improves upon the Sampli...
111
click to vote
UAI
1998
15 years 2 months ago
1998
There is evidence that the numbers in probabilistic inference don't really matter. This paper considers the idea that we can make a probabilistic model simpler by making fewe...
97
Voted
SWAT
2004
Springer
15 years 6 months ago
2004
Springer
We consider the speed scaling problem of minimizing the average response time of a collection of dynamically released jobs subject to a constraint A on energy used. We propose an ...