Sciweavers

74 search results - page 5 / 15
» A note on the size of minimal covers
Sort
View
TWC
2008
120views more  TWC 2008»
14 years 9 months ago
Energy minimization of a QAM system with fading
In this paper, the problem of choosing constellation size and transmit power that minimizes the energy-per-goodbit in a frequency-flat, long-term static fading channel is considere...
Raghavendra S. Prabhu, Babak Daneshrad
DLT
2007
14 years 11 months ago
Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP
Abstract. Inapproximability results concerning minimization of nondeterministic finite automata relative to given deterministic finite automata were obtained only recently, modul...
Hermann Gruber, Markus Holzer
ICALP
2010
Springer
15 years 2 months ago
Thresholded Covering Algorithms for Robust and Max-min Optimization
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
Anupam Gupta, Viswanath Nagarajan, R. Ravi
DLT
2007
14 years 11 months ago
State Complexity of Union and Intersection of Finite Languages
Abstract. We investigate the state complexity of union and intersection for finite languages. Note that the problem of obtaining the tight bounds for both operations was open. We ...
Yo-Sub Han, Kai Salomaa
KIVS
1999
Springer
15 years 2 months ago
Strategies for Minimizing the Average Cost of Paging on the Air Interface
: Location Management of mobile users in a cellular network covers tracking and paging (searching) functionality. In this paper a sequential search strategy is proposed which reduc...
Dogan Kesdogan, Andrei Trofimov, Dirk Trossen