Sciweavers

84 search results - page 3 / 17
» An Individually Variable Mutation-Rate Strategy for Genetic ...
Sort
View
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
13 years 9 months ago
A GP neutral function for the artificial ANT problem
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...
Esteban Ricalde, Katya Rodríguez-Váz...
GECCO
2005
Springer
141views Optimization» more  GECCO 2005»
13 years 11 months ago
Behavior of finite population variable length genetic algorithms under random selection
In this work we provide empirical evidence that shows how a variable-length genetic algorithm (GA) can naturally evolve shorter average size populations. This reduction in chromos...
Hal Stringer, Annie S. Wu
TSMC
2011
324views more  TSMC 2011»
13 years 22 days ago
Genetic Algorithms With Guided and Local Search Strategies for University Course Timetabling
—The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable ...
Shengxiang Yang, Sadaf Naseem Jat
BMCBI
2007
117views more  BMCBI 2007»
13 years 5 months ago
DNA-based watermarks using the DNA-Crypt algorithm
Background: The aim of this paper is to demonstrate the application of watermarks based on DNA sequences to identify the unauthorized use of genetically modified organisms (GMOs) ...
Dominik Heider, Angelika Barnekow
IJON
2007
80views more  IJON 2007»
13 years 5 months ago
Hardware implementation of a novel genetic algorithm
—This paper presents a novel genetic algorithm, termed the Optimum Individual Monogenetic Algorithm (OIMGA) and describes its hardware implementation. As the monogenetic strategy...
Z. Zhu, D. J. Mulvaney, Vassilios A. Chouliaras