Sciweavers

879 search results - page 48 / 176
» Optimizing for Reduced Code Space using Genetic Algorithms
Sort
View
GECCO
2006
Springer
148views Optimization» more  GECCO 2006»
15 years 5 months ago
An effective genetic algorithm for the minimum-label spanning tree problem
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
Jeremiah Nummela, Bryant A. Julstrom
TIT
2010
124views Education» more  TIT 2010»
14 years 8 months ago
Storage coding for wear leveling in flash memories
NAND flash memories are currently the most widely used type of flash memories. In a NAND flash memory, although a cell block consists of many pages, to rewrite one page, the whole ...
Anxiao Jiang, Robert Mateescu, Eitan Yaakobi, Jeho...
GECCO
2005
Springer
152views Optimization» more  GECCO 2005»
15 years 7 months ago
GAMM: genetic algorithms with meta-models for vision
Recent adaptive image interpretation systems can reach optimal performance for a given domain via machine learning, without human intervention. The policies are learned over an ex...
Greg Lee, Vadim Bulitko
GECCO
2005
Springer
175views Optimization» more  GECCO 2005»
15 years 7 months ago
Evolution of multi-loop controllers for fixed morphology with a cyclic genetic algorithm
Cyclic genetic algorithms can be used to generate single loop control programs for robots. While successful in generating controllers for individual leg movement, gait generation,...
Gary B. Parker, Ramona Georgescu
ICIP
2000
IEEE
16 years 3 months ago
Joint Space-Frequency Segmentation, Entropy Coding and the Compression of Ultrasound Images
Joint space-frequency segmentation is a relatively new image compression technique that finds the rate-distortion optimal representation of an image from a large set of possible s...
Ed Chiu, Jacques Vaisey, M. Stella Atkins