879 search results - page 37 / 176 » Optimizing for Reduced Code Space using Genetic Algorithms |
173
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
The basic idea to defend in this paper is that an adequate perception of the search space, sacrificing most of the precision, can paradoxically accelerate the discovery of the mo...
111
click to vote
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
A large and reliable DNA codeword library is key to the success of DNA based computing. Searching for sets of reliable DNA codewords is an NP-hard problem, which can take days on ...
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
In this paper, we provide an algorithm that systematically considers all small trees in the search space of genetic programming. These small trees are used to generate useful subr...
129
click to vote
CEC
2007
IEEE
15 years 8 months ago
2007
IEEE
—The Job-Shop Scheduling Problem (JSSP) is one of the most critical combinatorial optimization problems. The objective of JSSP in this research is to minimize the makespan. In th...
142
click to vote
TSE
2011
14 years 9 months ago
2011
—Randomized testing is an effective method for testing software units. Thoroughness of randomized unit testing varies widely according to the settings of certain parameters, such...