Sciweavers

451 search results - page 26 / 91
» On Parameterized Exponential Time Complexity
Sort
View
JSAC
2008
91views more  JSAC 2008»
13 years 9 months ago
A novel receiver architecture for single-carrier transmission over time-varying channels
In this paper, we present a single-carrier transceiver for rapidly time-varying channels, where the equalization step is implemented in the frequency domain. When the channel abide...
Zijian Tang, Geert Leus
LATIN
1998
Springer
14 years 2 months ago
The CREW PRAM Complexity of Modular Inversion
One of the long-standing open questions in the theory of parallel computation is the parallel complexity of the integer gcd and related problems, such as modular inversion. We pres...
Joachim von zur Gathen, Igor Shparlinski
AAAI
2010
13 years 11 months ago
Complexity of Computing Optimal Stackelberg Strategies in Security Resource Allocation Games
Recently, algorithms for computing game-theoretic solutions have been deployed in real-world security applications, such as the placement of checkpoints and canine units at Los An...
Dmytro Korzhyk, Vincent Conitzer, Ronald Parr
JC
2008
77views more  JC 2008»
13 years 9 months ago
A numerical algorithm for zero counting, I: Complexity and accuracy
We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(log(nD(f))) iterations (grid refinements) where n is...
Felipe Cucker, Teresa Krick, Gregorio Malajovich, ...
MANSCI
2008
96views more  MANSCI 2008»
13 years 9 months ago
Staffing of Time-Varying Queues to Achieve Time-Stable Performance
Continuing research by Jennings, Mandelbaum, Massey and Whitt (1996), we investigate methods to perform time-dependent staffing for many-server queues. Our aim is to achieve time-...
Zohar Feldman, Avishai Mandelbaum, William A. Mass...