9842 search results - page 209 / 1969 » Problem complexity |
EOR
2007
15 years 2 months ago
2007
In this note we study the tool switching problem with non-uniform tool sizes. More specifically, we consider the problem where the job sequence is given as part of the input. We ...
CORR
2007
Springer
15 years 2 months ago
2007
Springer
— The problem of designing high rate, full diversity noncoherent space-time block codes (STBCs) with low encoding and decoding complexity is addressed. First, the notion of g-gro...
103
Voted
FSTTCS
2008
Springer
15 years 3 months ago
2008
Springer
ABSTRACT. We study the algorithmic complexity of lattice problems based on Ajtai-Kumar-Sivakumar sieving technique [AKS01]. Given a k-dimensional subspace M ⊆ Rn and a full rank ...
110
Voted
INFOCOM
2007
IEEE
15 years 8 months ago
2007
IEEE
— We consider the problem of distributed scheduling in wireless networks. We present two different algorithms whose performance is arbitrarily close to that of maximal schedules,...
118
Voted
COCOON
2008
Springer
15 years 4 months ago
2008
Springer
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...