879 search results - page 38 / 176 » Optimizing for Reduced Code Space using Genetic Algorithms |
106
click to vote
DCC
2005
IEEE
16 years 1 months ago
2005
IEEE
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
132
click to vote
ISQED
2002
IEEE
15 years 6 months ago
2002
IEEE
This paper presents a fast algorithm to optimize both the widths and lengths of power/ground networks under reliability and power dip/ground bounce constraints. The spacesizing wh...
108
click to vote
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
Computationally identifying transcription factor binding sites in the promoter regions of genes is an important problem in computational biology and has been under intensive resea...
GECCO
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. Spatially structured population models improve the performance of genetic algorithms by assisting the selection scheme in maintaining diversity. A significant concern wi...
111
click to vote
ICGA
1993
15 years 3 months ago
1993
It is part of the traditional lore of genetic algorithms that low mutation rates lead to efficient search of the solution space, while high mutation rates result in diffusion of s...