746 search results - page 25 / 150 » Short Term Unit-Commitment Using Genetic Algorithms |
TEC
2008
13 years 7 months ago
2008
Abstract--The complexity of the selection procedure of a genetic algorithm that requires reordering, if we restrict the class of the possible fitness functions to varying fitness f...
IJCNN
2007
IEEE
14 years 2 months ago
2007
IEEE
—In this paper we present two algorithms that automatically calculate linear expressions for Time Series. To estimate the maximum number of terms of the linear expression and the...
KES
1999
Springer
14 years 1 days ago
1999
Springer
—Genetic Algorithms (GAs) are powerful search techniques that are used to solve difficult problems in many disciplines. Unfortunately, they can be very demanding in terms of com...
IWCMC
2010
ACM
14 years 26 days ago
2010
ACM
In reactive routing protocols, active routes for multihop connections retain their topological structure in spite of node movement over time. Unfortunately, node movements may mak...
RECOMB
2003
Springer
14 years 8 months ago
2003
Springer
Although analysis of genome rearrangements was pioneered by Dobzhansky and Sturtevant 65 years ago, we still know very little about the rearrangement events that produced the exis...