3750 search results - page 249 / 750 » Code Optimization for Code Compression |
144
click to vote
HPDC
2010
IEEE
15 years 4 months ago
2010
IEEE
The Semantic Web consists of many billions of statements made of terms that are either URIs or literals. Since these terms usually consist of long sequences of characters, an effe...
294
click to vote
CCIW
2011
Springer
14 years 7 months ago
2011
Springer
The representation model that considers an image as a sparse linear combination of few atoms of a predefined or learned dictionary has received considerable attention in recent ye...
129
click to vote
IEAAIE
1994
Springer
15 years 8 months ago
1994
Springer
Genetic Algorithms are heuristic search schemes based on a model of Darwinian evolution. Although not guaranteed to find the optimal solution, genetic algorithms have been shown t...
145
Voted
IWMM
2007
Springer
15 years 10 months ago
2007
Springer
In this work, we present accordion arrays, a straightforward and effective memory compression technique targeting Unicode-based character arrays. In many non-numeric Java programs...
125
click to vote
GECCO
2000
Springer
15 years 7 months ago
2000
Springer
In Real coded genetic algorithms, some crossover operators do not work well on functions which have their optimum at the corner of the search space. To cope with this problem, we ...