2714 search results - page 198 / 543 » Approximation Schemes for Scheduling |
124
Voted
ICAC
2007
IEEE
15 years 10 months ago
2007
IEEE
—A promising method of automating management tasks in computing systems is to formulate them as control or optimization problems in terms of performance metrics. For an online op...
133
Voted
FOCS
2005
IEEE
15 years 9 months ago
2005
IEEE
Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizatio...
117
click to vote
SPIRE
2005
Springer
15 years 9 months ago
2005
Springer
Let A and B be strings with lengths m and n, respectively, over a finite integer alphabet. Two classic string mathing problems are computing the edit distance between A and B, and...
131
click to vote
DAC
1999
ACM
15 years 8 months ago
1999
ACM
Approximate reachability techniques trade o accuracy for the capacity to deal with bigger designs. Cho et al 4 proposed partitioning the set of state bits into mutually disjoint s...
112
Voted
CISS
2007
IEEE
15 years 5 months ago
2007
IEEE
— In this paper, we present a simple technique to approximate the performance union bound of a punctured turbo code. The bound approximation exploits only those terms of the tran...