18306 search results - page 36 / 3662 » Algorithmics in Exponential Time |
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
The notion of distance constrained graph labelings, motivated by the Frequency Assignment Problem, reads as follows: A mapping from the vertex set of a graph G = (V, E) into an in...
TIT
2008
13 years 7 months ago
2008
In this paper, we analyze optimal (in space and time) adaptive power transmission policies for fading channels when the channel-state information (CSI) at the transmitter (CSIT) an...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We show several unconditional lower bounds for exponential time classes against polynomial time classes with advice, including:
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
— Many distributed multiple access (MAC) protocols use an exponential backoff mechanism. In that mechanism, a node picks a random backoff time uniformly in an interval that doubl...
CP
2004
Springer
14 years 1 months ago
2004
Springer
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...