Results 201 to 210 of about 12,025 (251)

A new insight into the schema survival after crossover and mutation for genetic algorithms having distributed population set

International Journal of Information Technology, 2018
Genetic algorithms are one of the most popular optimization algorithms. Schema theory provides a mathematical foundation for the working of genetic algorithm. Different variants of the basic genetic algorithm have been proposed; and genetic algorithm having distributed population set (Island model of genetic algorithm) is one of them.
Apoorva Mishra, Anupam Shukla
openaire   +2 more sources

Exact schema theory for genetic programming and variable-length genetic algorithms with one-point crossover

Genetic Programming and Evolvable Machines, 2001
Summary: A few schema theorems for genetic programming (GP) have been proposed in the literature in the last few years. Since they consider schema survival and disruption only, they can only provide a lower bound for the expected value of the number of instances of a given schema at the next generation rather than an exact value.
openaire   +2 more sources

Learning a dynamic policy by using policy gradient: application to biped walking

Systems and Computers in Japan, 2007
AbstractThis paper discusses a method in which periodic motion, such as biped walking, is acquired by the framework of reinforced learning. For an object with multiple degrees of freedom, it is in general difficult to acquire the policy by reinforced learning. There must be a framework of learning which is matched to the motion task under consideration.
Toru Nakanishi, Teruo Higashino, Tokumi Yokohira, Masataka Yonezu, Nobuo Funabiki, Tomoya Kitani   +5 more
openaire   +8 more sources

A Heuristic Genetic Algorithm Based on Schema Replacement for 0-1 Knapsack Problem

2010 Fourth International Conference on Genetic and Evolutionary Computing, 2010
This paper investigates the 0-1 knapsack problem using genetic algorithms. The work is based on heuristic strategies that takes into account the characteristics of 0-1 knapsack problem. In this article, a heuristic Genetic Algorithms(GA) is proposed to solve the 0-1 knapsack problem, in each generation, populations are divided into two sections ...
openaire   +2 more sources

A Novel Hybrid Particle Swarm Optimization Algorithm Combined with Harmony Search for High Dimensional Optimization Problems

The 2007 International Conference on Intelligent Pervasive Computing (IPC 2007), 2007
Multimedia technology, integrated with IT and communication technologies, provides wide range of services in diversified fields. These technologies are most frequently adopted in medical image processing sector, especially in medical image diagnosis. Presently, various researchers are actively conducting researches on the automation of reader system by
Euiin Choi, Sunghoon Cho, Moohun Lee, Bonghoi Kim   +3 more
openaire   +13 more sources

Short notes on the schema theorem and the building block hypothesis in genetic algorithms

1998
After decades of success, research on evolutionary algorithms aims at developing a sound theory that describes and predict the behavior of these algorithms. One research topic of interest is the analysis of the role of crossover and recombination in genetic algorithms, especially since various papers come to different conclusions.
openaire   +2 more sources

Genetic testing in prostate cancer management: Considerations informing primary care

Ca-A Cancer Journal for Clinicians, 2022
Veda N Giri, Jacob E Berchuck, Mary-ellen Taplin   +2 more
exaly  

Molecular imaging in oncology: Current impact and future directions

Ca-A Cancer Journal for Clinicians, 2022
Martin G Pomper, Steven P Rowe
exaly  

A review of cancer immunotherapy toxicity

Ca-A Cancer Journal for Clinicians, 2020
Lucy Boyce Kennedy
exaly  

Cancer epigenetics in clinical practice

Ca-A Cancer Journal for Clinicians, 2023
Veronica Davalos, Manel Esteller
exaly