33 search results - page 2 / 7 » Accelerating Real-Valued Genetic Algorithms Using Mutation-w... |
GECCO
2007
Springer
13 years 8 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 ...
PPSN
1994
Springer
13 years 8 months ago
1994
Springer
Abstract. The mutation distribution of evolutionary algorithms usually is oriented at the type of the search space. Typical examples are binomial distributions for binary strings i...
ACIVS
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. Computer vision algorithms are currently developed by looking up the available operators from the literature and then arranging those operators such that the desired task...
GECCO
2003
Springer
13 years 9 months ago
2003
Springer
The Linear Ordering Problem(LOP), which is a well-known NP-hard problem, has numerous applications in various fields. Using this problem as an example, we illustrate a general pro...
GECCO
2007
Springer
13 years 10 months ago
2007
Springer
A novel optimisation accelerator deploying neural network predictions and objective space direct manipulation strategies is presented. The concept of directing the search through ...