444 search results - page 50 / 89 » Solving Mastermind Using Genetic Algorithms |
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
Tournament selection is the most frequently used form of selection in genetic programming (GP). Tournament selection chooses individuals uniformly at random from the population. A...
GECCO
2006
Springer
14 years 10 days ago
2006
Springer
Classical chess engines exhaustively explore moving possibilities from a chessboard configuration to choose what the next best move to play is. In this article we present a new me...
AI
1999
Springer
13 years 8 months ago
1999
Springer
There are many different approaches to solving planning problems, one of which is the use of domain specific control knowledge to help guide a domain independent search algorithm. ...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
This paper presents a highly efficient, fully parallelized implementation of the compact genetic algorithm (cGA) to solve very large scale problems with millions to billions of va...
GECCO
2006
Springer
14 years 10 days ago
2006
Springer
The paper presents an approach based on principles of immune systems to the anomaly detection problem. Flexibility and efficiency of the anomaly detection system are achieved by b...