895 search results - page 102 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
106
click to vote
SODA
2012
ACM
13 years 1 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
IJBRA
2008
14 years 11 months ago
2008
Abstract Observing behaviors of protein pathways and genetic networks under various environments in living cells is essential for unraveling disease and developing drugs. For that ...
AHS
2007
IEEE
15 years 5 months ago
2007
IEEE
Rapid-prototyping of commercial devices and the demanding requirements for flexible hardware in mobile applications have driven the raise of reconfigurable hardware. The adaptatio...
108
click to vote
AOR
2010
14 years 8 months ago
2010
Column generation algorithms have been specially designed for solving mathematical programs with a huge number of variables. Unfortunately, this method suffers from slow convergen...
HM
2007
Springer
15 years 5 months ago
2007
Springer
This paper deals with the Permutation Flow Shop scheduling problem with the objective of minimizing total flow time, and therefore reducing in-process inventory. A new hybrid meta...