8016 search results - page 99 / 1604 » On the practical genetic algorithms |
188
click to vote
HPCC
2007
Springer
16 years 15 days ago
2007
Springer
Many of today’s embedded systems, such as wireless and portable devices rely heavily on the limited power supply. Therefore, energy efficiency becomes one of the major design con...
156
click to vote
GECCO
2005
Springer
15 years 12 months ago
2005
Springer
Cellular genetic algorithms (cGAs) are mainly characterized by their spatially decentralized population, in which individuals can only interact with their neighbors. In this work,...
171
click to vote
SAC
2000
ACM
15 years 10 months ago
2000
ACM
The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...
149
click to vote
ICNS
2007
IEEE
16 years 20 days ago
2007
IEEE
— Short flow first scheduling (SFF) strategy is effective in obtaining more stringent performance bounds for short flows in Internet. However, previous strict SFF approaches i...
176
click to vote
WADS
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...