454 search results - page 48 / 91 » On improving approximate solutions by evolutionary algorithm... |
125
click to vote
FOCS
2004
IEEE
15 years 5 months ago
2004
IEEE
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...
ESA
2010
Springer
15 years 2 months ago
2010
Springer
The inability to answer proximity queries efficiently for spaces of dimension d > 2 has led to the study of approximation to proximity problems. Several techniques have been pro...
134
click to vote
BMCBI
2006
15 years 1 months ago
2006
Background: Single nucleotide polymorphisms (SNPs) are locations at which the genomic sequences of population members differ. Since these differences are known to follow patterns,...
115
click to vote
EMO
2003
Springer
15 years 6 months ago
2003
Springer
This article proposes the Two-Phase Local Search for finding a good approximate set of non-dominated solutions. The two phases of this procedure are to (i) generate an initial sol...
121
click to vote
PPSN
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. In this paper, we elaborate how decision space diversity can be integrated into indicator-based multiobjective search. We introduce DIOP, the diversity integrating multio...