2412 search results - page 122 / 483 » Which Problems Have Strongly Exponential Complexity |
115
click to vote
TSP
2008
15 years 3 months ago
2008
Sign-selection uses a set of subcarrier signs to reduce the peak-to-average power ratio (PAR) of orthogonal-frequency-division multiplexing (OFDM). However, the computational compl...
119
click to vote
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boun...
128
click to vote
STOC
2004
ACM
16 years 3 months ago
2004
ACM
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
111
Voted
ZUM
2000
Springer
15 years 6 months ago
2000
Springer
: Retrenchment is introduced as a liberalisation of refinement intended to address some of the shortcomings of refinement as sole means of progressing from simple abstract models t...
114
Voted
ROBOCOMM
2007
IEEE
15 years 9 months ago
2007
IEEE
—Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This paper analyzes coalescence time ...