415 search results - page 21 / 83 » An efficient approximation for the Generalized Assignment Pr... |
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
FCT
2007
Springer
14 years 11 days ago
2007
Springer
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
UAI
2001
13 years 9 months ago
2001
There is increasing interest within the research community in the design and use of recursive probability models. There remains concern about computational complexity costs and th...
COCOON
2008
Springer
13 years 10 months ago
2008
Springer
In this paper, we study the spectrum assignment problem for wireless access networks. Opportunistic spectrum usage is a promising technology. However, it could suffer from the self...
TCS
2008
13 years 8 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 ...