Sciweavers

2157 search results - page 318 / 432
» Optimal Fast Hashing
Sort
View
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
15 years 5 months ago
Mirrored variants of the (1, 2)-CMA-ES compared on the noiseless BBOB-2010 testbed
Derandomization by means of mirroring has been recently introduced to enhance the performances of (1, λ)-EvolutionStrategies (ESs) with the aim of designing fast robust local sea...
Anne Auger, Dimo Brockhoff, Nikolaus Hansen
GECCO
2010
Springer
157views Optimization» more  GECCO 2010»
15 years 5 months ago
Mirrored variants of the (1, 4)-CMA-ES compared on the noiseless BBOB-2010 testbed
Derandomization by means of mirrored samples has been recently introduced to enhance the performances of (1, λ)Evolution-Strategies (ESs) with the aim of designing fast and robus...
Anne Auger, Dimo Brockhoff, Nikolaus Hansen
HIPEAC
2010
Springer
15 years 5 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...
AIA
2007
15 years 4 months ago
Minimizing leakage: What if every gate could have its individual threshold voltage?
Designers aim at fast but low-power consuming integrated circuits. Since high processing speed always comes with high energy demands, the literature provides several ways to reduc...
Ralf Salomon, Frank Sill, Dirk Timmermann
ACL
2006
15 years 4 months ago
A Best-First Probabilistic Shift-Reduce Parser
Recently proposed deterministic classifierbased parsers (Nivre and Scholz, 2004; Sagae and Lavie, 2005; Yamada and Matsumoto, 2003) offer attractive alternatives to generative sta...
Kenji Sagae, Alon Lavie