879 search results - page 89 / 176 » Optimizing for Reduced Code Space using Genetic Algorithms |
102
Voted
WEA
2007
Springer
15 years 8 months ago
2007
Springer
Given a sequence S of n symbols over some alphabet Σ, we develop a new compression method that is (i) very simple to implement; (ii) provides O(1) time random access to any symbol...
126
Voted
IPL
2010
15 years 1 months ago
2010
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
116
Voted
SIGSOFT
2007
ACM
16 years 3 months ago
2007
ACM
There has recently been a great deal of interest in search? based test data generation, with many local and global search algorithms being proposed. However, to date, there has be...
114
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
Code bloat, the excessive increase of code size, is an important issue in Genetic Programming (GP). This paper proposes a theoretical analysis of code bloat in the framework of sy...
109
Voted
ICMLA
2007
15 years 4 months ago
2007
Optimal Component Analysis (OCA) is a linear method for feature extraction and dimension reduction. It has been widely used in many applications such as face and object recognitio...