2714 search results - page 281 / 543 » Approximation Schemes for Scheduling |
124
click to vote
EOR
2006
15 years 4 months ago
2006
In this paper, we present a stochastic model for the dynamic fleet management problem with random travel times. Our approach decomposes the problem into time-staged subproblems by...
139
click to vote
ICASSP
2010
IEEE
15 years 2 months ago
2010
IEEE
This paper proposes an improved model for the transient of convex combinations of adaptive filters. A previous model, based on a firstorder Taylor series approximation of the nonl...
127
Voted
INFOCOM
2000
IEEE
15 years 8 months ago
2000
IEEE
— In broadcast disk systems, information is broadcasted in a shared medium. When a client needs an item from the disk, it waits until that item is broadcasted. The fundamental al...
133
Voted
WINET
2010
15 years 2 months ago
2010
— As wireless access technologies improve in data rates, the problem focus is shifting towards providing adequate backhaul from the wireless access points to the Internet. Existi...
144
Voted
SODA
2010
ACM
16 years 1 months ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...