Sciweavers

648 search results - page 90 / 130
» Lowness for Demuth Randomness
Sort
View
AE
2005
Springer
14 years 4 months ago
Algorithms (X, sigma, eta): Quasi-random Mutations for Evolution Strategies
Randomization is an efficient tool for global optimization. We here define a method which keeps : – the order 0 of evolutionary algorithms (no gradient) ; – the stochastic as...
Anne Auger, Mohamed Jebalia, Olivier Teytaud
FPL
2005
Springer
112views Hardware» more  FPL 2005»
14 years 4 months ago
Defect-Tolerant FPGA Switch Block and Connection Block with Fine-Grain Redundancy for Yield Enhancement
Future process nodes have such small feature sizes that there will be an increase in the number of manufacturing defects per die. For large FPGAs, it will be critical to tolerate ...
Anthony J. Yu, Guy G. Lemieux
ICCSA
2005
Springer
14 years 4 months ago
Sinogram Denoising of Cryo-Electron Microscopy Images
Cryo-electron microscopy has recently been recognized as a useful alternative to obtain three-dimensional density maps of macromolecular complexes, especially when crystallography ...
Taneli Mielikäinen, Janne Ravantti
ASPDAC
2004
ACM
109views Hardware» more  ASPDAC 2004»
14 years 4 months ago
Design methodology for IRA codes
Channel coding is an important building block in communication systems since it ensures the quality of service. Irregular repeat-accumulate (IRA) codes belong to the class of Low-...
Frank Kienle, Norbert Wehn
ICOIN
2004
Springer
14 years 4 months ago
On Reducing Paging Cost in IP-Based Wireless/Mobile Networks
For more scalable mobile services, it is important to reduce the signaling cost for location management. In this paper, we propose a cost effective IP paging scheme utilizing expl...
Kyoungae Kim, Sangheon Pack, Yanghee Choi