206 search results - page 6 / 42 » A branch-and-bound algorithm for hard multiple knapsack prob... |
FUIN
2000
14 years 9 months ago
2000
We consider the problem of dependable computation with multiple inputs. The goal is to study when redundancy can help to achieve survivability and when it cannot. We use AND/OR gra...
AAIM
2009
Springer
15 years 4 months ago
2009
Springer
: © Efficiently Generating k-Best Solutions to Procurement Auctions Andrew Byde, Terence Kelly, Yunhong Zhou, Robert Tarjan HP Laboratories HPL-2009-163 procurement, auctions, dec...
FSTTCS
2007
Springer
15 years 3 months ago
2007
Springer
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a singl...
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
In this study, a new mechanism that adapts the mutation rate for each locus on the chromosomes, based on feedback obtained from the current population is proposed. Through tests us...
TSE
2010
14 years 4 months ago
2010
Search-based software engineering is an emerging paradigm that uses automated search algorithms to help designers iteratively find solutions to complicated design problems. For exa...