Sciweavers

444 search results - page 63 / 89
» Solving Mastermind Using Genetic Algorithms
Sort
View
CEC
2007
IEEE
14 years 3 months ago
A Memetic Algorithm for test data generation of Object-Oriented software
— Generating test data for Object-Oriented (OO) software is a hard task. Little work has been done on the subject, and a lot of open problems still need to be investigated. In th...
Andrea Arcuri, Xin Yao
GECCO
2007
Springer
119views Optimization» more  GECCO 2007»
14 years 2 months ago
Optimising the flow of experiments to a robot scientist with multi-objective evolutionary algorithms
A Robot Scientist is a physically implemented system that applies artificial intelligence to autonomously discover new knowledge through cycles of scientific experimentation. Ad...
Emma Byrne
TCS
2008
13 years 8 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman
GECCO
2006
Springer
167views Optimization» more  GECCO 2006»
14 years 11 days ago
Genomic computing networks learn complex POMDPs
A genomic computing network is a variant of a neural network for which a genome encodes all aspects, both structural and functional, of the network. The genome is evolved by a gen...
David J. Montana, Eric Van Wyk, Marshall Brinn, Jo...
EOR
2008
200views more  EOR 2008»
13 years 8 months ago
General variable neighborhood search for the continuous optimization
We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Diff...
Nenad Mladenovic, Milan Drazic, Vera Kovacevic-Vuj...