Sciweavers

879 search results - page 11 / 176
» Optimizing for Reduced Code Space using Genetic Algorithms
Sort
View
GECCO
2008
Springer
278views Optimization» more  GECCO 2008»
15 years 2 months ago
Elitism reduces bloat in genetic programming
Elitism is commonly used in generational GP to ensure that the best individuals discovered in a generation are not lost, and are made available for possible further improvements t...
Riccardo Poli, Nicholas Freitag McPhee, Leonardo V...
ICASSP
2011
IEEE
14 years 5 months ago
Joint algorithm-architecture optimization of CABAC to increase speed and reduce area cost
To address the increasing demand for higher resolution and frame rates, processing speed (i.e. performance) and area cost need to be considered in the development of next generati...
Vivienne Sze, Anantha P. Chandrakasan
102
Voted
IEICET
2010
96views more  IEICET 2010»
15 years 11 days ago
An Unsupervised Optimization of Structuring Elements for Noise Removal Using GA
—To recover texture images from impulse noise by the opening operation which is one of morphological operations, an suitable structuring element (SE) has to be estimated. Hithert...
Hiroyuki Okuno, Yoshiko Hanada, Mitsuji Muneyasu, ...
CC
2004
Springer
15 years 7 months ago
Using Multiple Memory Access Instructions for Reducing Code Size
An important issue in embedded systems design is the size of programs. As computing devices decrease in size, yet with more and more functions, better code size optimizations are i...
Neil Johnson, Alan Mycroft
MICRO
1990
IEEE
147views Hardware» more  MICRO 1990»
15 years 5 months ago
Motivation and framework for using genetic algorithms for microcode compaction
Genetic algorithms are a robust adaptive optimization technique based on a biological paradigm. They perform efficient search on poorly-defined spaces by maintaining an ordered po...
Steven J. Beaty, Darrell Whitley, Gearold Johnson