894 search results - page 12 / 179 » Parameter-less evolutionary search |
117
click to vote
TAINN
2005
Springer
15 years 2 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
ALIFE
2006
14 years 9 months ago
2006
An evolutionary system that supports the interaction of neutral and adaptive mutations is investigated. Experimental results on a Boolean function and needle-in-haystack problems s...
72
Voted
GECCO
2004
Springer
15 years 2 months ago
2004
Springer
Software systems are used regularly in safety-relevant applications. Therefore, the occurrence of critical defects may not only cause costly recalls but may also endanger human liv...
GECCO
2000
Springer
15 years 1 months ago
2000
Springer
The success of decoder-based evolutionary algorithms (EAs) strongly depends on the achieved locality of operators and decoders. Most approaches to investigate locality properties ...
PPSN
2004
Springer
15 years 2 months ago
2004
Springer
We consider the problem of finding small Golomb rulers, a hard combinatorial optimization task. This problem is here tackled by means of a hybrid evolutionary algorithm (EA). This...