451 search results - page 17 / 91 » On Parameterized Exponential Time Complexity |
IPL
2008
13 years 9 months ago
2008
We describe a new algorithm for the problem of perfect sorting a signed permutation by reversals. The worst-case time complexity of this algorithm is parameterized by the maximum p...
ISSAC
1997
Springer
14 years 2 months ago
1997
Springer
Gaussian elimination is the basis for classical algorithms for computing canonical forms of integer matrices. Experimental results have shown that integer Gaussian elimination may...
CEC
2007
IEEE
14 years 4 months ago
2007
IEEE
— Estimation of Distribution Algorithm (EDA) is a well-known stochastic optimization technique. The average time complexity is a crucial criterion that measures the performance o...
AAAI
1993
13 years 11 months ago
1993
This paper analyzes the complexity of on-line reinforcement learning algorithms, namely asynchronous realtime versions of Q-learning and value-iteration, applied to the problem of...
GLOBECOM
2006
IEEE
14 years 3 months ago
2006
IEEE
—Design of space-time codes that scale with the number of transmit antennas is a difficult problem. In this paper, we introduce a new family of space-time trellis codes (STTC) th...