850 search results - page 34 / 170 » On Genetic Algorithms and Lindenmayer Systems |
GECCO
2003
Springer
15 years 7 months ago
2003
Springer
Following the work of Stephens and coworkers on the coarse-grained dynamics of genetic systems, we work towards a possible generalisation in the context of genetic algorithms, givi...
237
Voted
ICC
2011
IEEE
14 years 1 months ago
2011
IEEE
—Ant colony optimization (ACO) is a probabilistic technique used for solving complex computational problems, such as finding optimal routes in networks. It has been proved to pe...
148
click to vote
ISDA
2008
IEEE
15 years 8 months ago
2008
IEEE
Due to their excellent performance in solving combinatorial optimization problems, metaheuristics algorithms such as Genetic Algorithms (GA), Simulated Annealing (SA) and Tabu Sea...
166
Voted
CISIS
2011
IEEE
14 years 1 months ago
2011
IEEE
—Computational performance increasingly depends on parallelism, and many systems rely on heterogeneous resources such as GPUs and FPGAs to accelerate computationally intensive ap...
101
Voted
ICTAI
1993
IEEE
15 years 6 months ago
1993
IEEE
Unit commitment is a complex decision-making process because of multiple constraints which must not be violated while nding the optimal or a near-optimal commitment schedule. This...