152 search results - page 16 / 31 » Tetris is Hard, Even to Approximate |
PERCOM
2006
ACM
14 years 7 months ago
2006
ACM
In this paper, we study the problem of utility maximization in multi-hop wireless systems. To study the effect of wireless interference constraints on the utility maximization pro...
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
WINE
2005
Springer
14 years 26 days ago
2005
Springer
We study a model of path-vector routing in which nodes’ routing policies are based on subjective cost assessments of alternative routes. The routes are constrained by the requir...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
We consider the problem of choosing, sequentially, a map which assigns elements of a set A to a few elements of a set B. On each round, the algorithm suffers some cost associated ...
STACS
2004
Springer
14 years 22 days ago
2004
Springer
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...