Sciweavers

1042 search results - page 97 / 209
» Fast Population Coding
Sort
View
ACMSE
2006
ACM
14 years 27 days ago
Achieving efficient polynomial multiplication in fermat fields using the fast Fourier transform
We introduce an efficient way of performing polynomial multiplication in a class of finite fields GF(pm ) in the frequency domain. The Fast Fourier Transform (FFT) based frequency...
Selçuk Baktir, Berk Sunar
GECCO
2008
Springer
121views Optimization» more  GECCO 2008»
13 years 10 months ago
Fast rule representation for continuous attributes in genetics-based machine learning
Genetic-Based Machine Learning Systems (GBML) are comparable in accuracy with other learning methods. However, efficiency is a significant drawback. This paper presents a new rep...
Jaume Bacardit, Natalio Krasnogor
VLSISP
2008
173views more  VLSISP 2008»
13 years 9 months ago
Fast Bit Gather, Bit Scatter and Bit Permutation Instructions for Commodity Microprocessors
Advanced bit manipulation operations are not efficiently supported by commodity word-oriented microprocessors. Programming tricks are typically devised to shorten the long sequence...
Yedidya Hilewitz, Ruby B. Lee
IPPS
2007
IEEE
14 years 3 months ago
Optimizing the Fast Fourier Transform on a Multi-core Architecture
The rapid revolution in microprocessor chip architecture due to multicore technology is presenting unprecedented challenges to the application developers as well as system softwar...
Long Chen, Ziang Hu, Junmin Lin, Guang R. Gao
CAV
2007
Springer
166views Hardware» more  CAV 2007»
14 years 3 months ago
Fast and Accurate Static Data-Race Detection for Concurrent Programs
We present new techniques for fast, accurate and scalable static data race detection in concurrent programs. Focusing our analysis on Linux device drivers allowed us to identify th...
Vineet Kahlon, Yu Yang, Sriram Sankaranarayanan, A...