4843 search results - page 523 / 969 » The Shortcut Problem - Complexity and Approximation |
163
click to vote
ISAAC
2007
Springer
16 years 11 days ago
2007
Springer
Trajectory data is becoming increasingly available and the size of the trajectories is getting larger. In this paper we study the problem of compressing spatio-temporal trajectorie...
171
click to vote
ECRTS
2006
IEEE
16 years 9 days ago
2006
IEEE
A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform with static-priority scheduli...
156
click to vote
FOCS
2006
IEEE
16 years 9 days ago
2006
IEEE
In this paper we present a new approximation algorithm for Unique Games. For a Unique Game with n vertices and k states (labels), if a (1 − ε) fraction of all constraints is sa...
128
click to vote
GLOBECOM
2006
IEEE
16 years 9 days ago
2006
IEEE
Abstract— In this paper, we propose a power optimal opportunistic scheduling scheme for a multiuser single hop Time Division Multiple Access (TDMA) system. We formulate the probl...
263
click to vote
IPPS
2005
IEEE
15 years 12 months ago
2005
IEEE
In this paper, we introduce the combinatorial auction model for resource management in grids. We propose a combinatorial auction-based resource allocation protocol in which a user...