Sciweavers

1243 search results - page 10 / 249
» Complexity reduction of C-Algorithm
Sort
View
GLOBECOM
2008
IEEE
16 years 8 days ago
Novel Low-Complexity SLM Schemes for PAPR Reduction in OFDM Systems
Chih-Peng Li, Sen-Hung Wang, Kun-Sheng Lee, Chin-L...
LICS
2008
IEEE
16 years 6 days ago
On the Computational Complexity of Cut-Reduction
Using appropriate notation systems for proofs, cutreduction can often be rendered feasible on these notations. Explicit bounds can be given. Developing a suitable notation system ...
Klaus Aehlig, Arnold Beckmann
CDC
2009
IEEE
166views Control Systems» more  CDC 2009»
15 years 10 months ago
Idempotent method for dynamic games and complexity reduction in min-max expansions
— In recent years, idempotent methods (specifically, max-plus methods) have been developed for solution of nonlinear control problems. It was thought that idempotent linearity o...
William M. McEneaney