548 search results - page 31 / 110 » Using the Genetic Algorithm to Find Snake-in-the-Box Codes |
AUSAI
2004
Springer
14 years 2 months ago
2004
Springer
In this paper we introduce an Ant Colony Optimisation (ACO) algorithm to find solutions for the well-known Knight’s Tour problem. The algorithm utilizes the implicit parallelism ...
ICONIP
2004
13 years 10 months ago
2004
Abstract. Data embedding in digital images involves a trade off relationship among imperceptibility, robustness, data security and embedding rate etc. Genetic Algorithms (GA) can b...
ICCCI
2011
Springer
12 years 8 months ago
2011
Springer
Multiagent reinforcement learning problems are especially difficult because of their dynamism and the size of joint state space. In this paper a new benchmark problem is proposed, ...
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
A powerful approach to search is to try to learn a distribution of good solutions (in particular of the dependencies between their variables) and use this distribution as a basis ...
CEC
2005
IEEE
13 years 11 months ago
2005
IEEE
Axelrod’s original experiments for evolving IPD player strategies involved the use of a basic GA. In this paper we examine how well a simple GA performs against the more recent P...