6 search results - page 1 / 2 » A Space--Time Tradeoff for Permutation Problems |
SODA
2010
ACM
14 years 2 months ago
2010
ACM
Many combinatorial problems--such as the traveling salesman, feedback arcset, cutwidth, and treewidth problem-can be formulated as finding a feasible permutation of n elements. Ty...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
A recent result of Zheng and Tse states that over a quasi-static channel, there exists a fundamental tradeoff, referred to as the diversity-multiplexing gain (D-MG) tradeoff, betwe...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
Abstract— In this paper, collocated and distributed spacetime block codes (DSTBCs) which admit multi-group maximum likelihood (ML) decoding are studied. First the collocated case...
AAAI
2007
13 years 7 months ago
2007
In recent years, planning and scheduling research has paid increasing attention to problems that involve resource oversubscription, where cumulative demand for resources outstrips...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We consider the problem of optimal probing of states of a channel by transmitter and receiver for maximizing rate of reliable communication. The channel is discrete memoryless (DM...