Sciweavers

746 search results - page 3 / 150
» Short Term Unit-Commitment Using Genetic Algorithms
Sort
View
AAECC
2000
Springer
81views Algorithms» more  AAECC 2000»
13 years 7 months ago
On Short Multiplications and Divisions
Computing only the low degree terms of the product of two univariate polynomials is called a short multiplication. By decomposition into subproblems, a short multiplication can be ...
Thom Mulders
BIB
2008
141views more  BIB 2008»
13 years 7 months ago
Detecting short tandem repeats from genome data: opening the software black box
Short tandem repeats, specifically microsatellites, are widely used genetic markers, associated with human genetic diseases, and play an important role in various regulatory mecha...
Angelika Merkel, Neil Gemmell
GECCO
2004
Springer
14 years 1 months ago
Improving the Performance of a Genetic Algorithm Using a Variable-Reordering Algorithm
Genetic algorithms have been successfully applied to many difficult problems but there have been some disappointing results as well. In these cases the choice of the internal repre...
Eduardo Rodriguez-Tello, Jose Torres-Jimenez
PPSN
1992
Springer
13 years 11 months ago
Nonstationary Function Optimization using the Structured Genetic Algorithm
In this paper, we describe the application of a new type of genetic algorithm called the Structured Genetic Algorithm (sGA) for function optimization in nonstationary environments...
Dipankar Dasgupta, Douglas R. McGregor
CEC
2005
IEEE
14 years 1 months ago
Finding attack strategies for predator swarms using genetic algorithms
Abstract- Behavior based architectures have many parameters that must be tuned to produce effective and believable agents. We use genetic algorithms to tune simple behavior based c...
Ryan E. Leigh, Tony Morelli, Sushil J. Louis, Moni...