Sciweavers

6365 search results - page 420 / 1273
» Fast Local Computation Algorithms
Sort
View
ICASSP
2008
IEEE
16 years 1 months ago
Avoiding divergence in the constant modulus algorithm
One of the most popular algorithms for blind equalization is the Constant Modulus Algorithm (CMA), due to its simplicity and low computational cost. However, if the step-size is n...
Maria D. Miranda, M. T. M. Silva, Vitor H. Nascime...
GECCO
2007
Springer
212views Optimization» more  GECCO 2007»
16 years 1 months ago
A hybrid evolutionary programming algorithm for spread spectrum radar polyphase codes design
This paper presents a hybrid evolutionary programming algorithm to solve the spread spectrum radar polyphase code design problem. The proposed algorithm uses an Evolutionary Progr...
Ángel M. Pérez-Bellido, Sancho Salce...
ACTA
2006
108views more  ACTA 2006»
15 years 7 months ago
Refinement verification of the lazy caching algorithm
The lazy caching algorithm of Afek, Brown, and Merrit (1993) is a protocol that allows the use of local caches with delayed updates. It results in a memory model that is not atomi...
Wim H. Hesselink
GECCO
2004
Springer
127views Optimization» more  GECCO 2004»
16 years 8 days ago
Computational Complexity and Simulation of Rare Events of Ising Spin Glasses
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
Martin Pelikan, Jiri Ocenasek, Simon Trebst, Matth...
HIPEAC
2010
Springer
15 years 8 months ago
Computer Generation of Efficient Software Viterbi Decoders
This paper presents a program generator for fast software Viterbi decoders for arbitrary convolutional codes. The input to the generator is a specification of the code and a single...
Frédéric de Mesmay, Srinivas Chellap...