350 search results - page 66 / 70 » Approximation Algorithms for Unique Games |
TCS
2008
13 years 7 months ago
2008
We study a problem of scheduling client requests to servers. Each client has a particular latency requirement at each server and may choose either to be assigned to some server in ...
VC
1998
13 years 7 months ago
1998
The vertex representation, a new data structure for representing and manipulating orthogonal objects, is presented. Both interiors and boundaries of regions are represented implic...
MOBIHOC
2007
ACM
14 years 7 months ago
2007
ACM
We consider distributed opportunistic scheduling (DOS) in wireless ad-hoc networks, where many links contend for the same channel using random access. In such networks, distribute...
CP
2000
Springer
13 years 11 months ago
2000
Springer
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...