879 search results - page 109 / 176 » Optimizing for Reduced Code Space using Genetic Algorithms |
131
Voted
CASES
2006
ACM
15 years 8 months ago
2006
ACM
Previous object code compression schemes have employed static and semiadaptive compression algorithms to reduce the size of instruction memory in embedded systems. The suggestion ...
121
click to vote
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
A genome rearrangement scenario describes a series of chromosome fusion, fission, and translocation operations that suffice to rewrite one genome into another. Exact algorithmic ...
102
Voted
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
Spatial based gene selection for division of chromosomes used by crossover operators is proposed for three-dimensional problems. This spatial selection is shown to preserve more g...
123
click to vote
CODES
2006
IEEE
15 years 8 months ago
2006
IEEE
The use of Application Specific Instruction-set Processors (ASIP) is a solution to the problem of increasing complexity in embedded systems design. One of the major challenges in...
124
click to vote
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...