2714 search results - page 91 / 543 » Approximation Schemes for Scheduling |
158
click to vote
PODS
2006
ACM
16 years 3 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
126
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
We study problems of scheduling jobs on related machines so as to minimize the makespan in the setting where machines are strategic agents. In this problem, each job j has a lengt...
121
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
146
Voted
FSS
2002
15 years 3 months ago
2002
Recently, various adaptive fuzzy control schemes have been proposed to deal with nonlinear systems whose dynamics are poorly understood by using the parameterized fuzzy approximat...
134
Voted
CP
2004
Springer
15 years 8 months ago
2004
Springer
We study the quality of LP-based approximation methods for pure combinatorial problems. We found that the quality of the LPrelaxation is a direct function of the underlying constra...