15485 search results - page 177 / 3097 » Computing Optimal Subsets |
167
click to vote
BIBE
2007
IEEE
16 years 20 days ago
2007
IEEE
Abstract—Recent improvements in high-throughput genotyping technology make possible genome-wide association studies and status prediction (classification) for common complex dis...
155
click to vote
DCC
2007
IEEE
16 years 5 months ago
2007
IEEE
The low-density attack proposed by Lagarias and Odlyzko is a powerful algorithm against the subset sum problem. The improvement algorithm due to Coster et al. would solve almost a...
149
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Scenarios are pen-pictures of plausible futures, used for strategic planning. The aim of this investigation is to expand the horizon of scenario-based planning through computation...
156
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...