20197 search results - page 3459 / 4040 » Comparing Computational Power |
175
click to vote
GECCO
2007
Springer
16 years 18 days ago
2007
Springer
It is not unusual for a software development organization to expend 40 percent of total project effort on testing, which can be a very laborious and time-consuming process. Thus, ...
167
click to vote
GECCO
2007
Springer
16 years 18 days ago
2007
Springer
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...
169
click to vote
GECCO
2007
Springer
16 years 18 days ago
2007
Springer
Simulated binary crossover (SBX) is a real-parameter recombination operator which is commonly used in the evolutionary algorithm (EA) literature. The operator involves a parameter...
175
click to vote
GECCO
2007
Springer
16 years 18 days ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
159
click to vote
GECCO
2007
Springer
16 years 18 days ago
2007
Springer
The Cross Entropy algorithm is a new search method for combinatorial problem. However, it needs considerable computational time to achieve good solution quality. To make the Cross...