Sciweavers

8016 search results - page 107 / 1604
» On the practical genetic algorithms
Sort
View
IPPS
1998
IEEE
15 years 10 months ago
A Comparative Study of Five Parallel Genetic Algorithms Using the Traveling Salesman Problem
Parallel genetic algorithms (PGAs) have been developed to reduce the large execution times that are associated with serial genetic algorithms (SGAs). They have also been used to s...
Lee Wang, Anthony A. Maciejewski, Howard Jay Siege...
VLSID
1997
IEEE
135views VLSI» more  VLSID 1997»
15 years 10 months ago
Parallel Genetic Algorithms for Simulation-Based Sequential Circuit Test Generation
The problem of test generation belongs to the class of NP-complete problems and it is becoming more and more di cult as the complexity of VLSI circuits increases, and as long as e...
Dilip Krishnaswamy, Michael S. Hsiao, Vikram Saxen...
GECCO
2006
Springer
186views Optimization» more  GECCO 2006»
15 years 10 months ago
Genetic algorithms for action set selection across domains: a demonstration
Action set selection in Markov Decision Processes (MDPs) is an area of research that has received little attention. On the other hand, the set of actions available to an MDP agent...
Greg Lee, Vadim Bulitko
PPSN
2000
Springer
15 years 10 months ago
Symbiotic Combination as an Alternative to Sexual Recombination in Genetic Algorithms
Recombination in the Genetic Algorithm (GA) is supposed to enable the component characteristics from two parents to be extracted and then reassembled in different combinations
Richard A. Watson, Jordan B. Pollack
ICGA
1993
296views Optimization» more  ICGA 1993»
15 years 7 months ago
A Genetic Algorithm Applied to the Maximum Flow Problem
A genetic algorithms is applied to find a maximum flow from the source to sink in a weighted directed graph, where the weight associated with each edge represents its flow capacit...
Toshinori Munakata, David J. Hashier