Optimizing GoTools' Search Heuristics using Genetic Algorithms
GoTools is a program which solves life & death problems in the game of Go. This paper describes experiments using
47 indexed results
GoTools is a program which solves life & death problems in the game of Go. This paper describes experiments using
A self-organizing particle swarm is presented. It works in dissipative state by employing the small inertia weight, according to experimental
It is still unclear how an evolutionary algorithm (EA) searches a fitness landscape, and on what fitness landscapes a particular
The regulation of a gene depends on the binding of transcription factors to specific sites located in the regulatory region
A dissipative particle swarm optimization is developed according to the self-organization of dissipative structure. The negative entropy is introduced to
Each year perhaps millions of young people face the following dilemma: should I continue my education or rather start working
A new quantity, average fitness, is introduced in Bak-Sneppen evolution model. Through this new quantity, a new hierarchy of avalanches
Neoteny, also spelled Paedomorphosis, can be defined in biological terms as the retention by an organism of juvenile or even
In modern biology, one of the most important research problems is to understand how protein sequences fold into their native
In this paper we develop an evidential force aggregation method intended for classification of evidential intelligence into recognized force structures.
An Algorithm is proposed for the simulation of pure SU(N) lattice gauge theories based on Genetic Algorithms(GAs). Main difference between
These lectures contain a brief description of evolutionary models inspired by the statistical mechanics of disordered systems. After an introduction
For Lee Smolin, our universe is only one in a much larger cosmos (the Multiverse) - a member of a
We present here a study of the clustering and cycles present in the graph of Internet at the Autonomous Systems
Genetic algorithms (GAs) that solve hard problems quickly, reliably and accurately are called competent GAs. When the fitness landscape of
Evolving one-dimensional cellular automata (CAs) with genetic algorithms has provided insight into how improved performance on a task requiring global
This article gives a brief introduction to the mathematical modeling of large-scale biological evolution and extinction. We give three examples
This article describes a gradient complex network model whose weights are proportional to the difference between uniformly distributed ``fitness'' values
We propose a sub-structural niching method that fully exploits the problem decomposition capability of linkage-learning methods such as the estimation
Niching enables a genetic algorithm (GA) to maintain diversity in a population. It is particularly useful when the problem has
In this paper we describe SYNERGY, which is a highly parallelizable, linear planning system that is based on the genetic
Neoteny, also spelled Paedomorphosis, can be defined in biological terms as the retention by an organism of juvenile or even
In the calculation of the anomalous magnetic moment of $W^\pm$ bosons, we discuss vector anomalies occuring in the fermion loop