1603 search results - page 68 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
188
click to vote
EUROGP
2007
Springer
15 years 10 months ago
2007
Springer
This work details an auction-based model for problem decomposition in Genetic Programming classification. The approach builds on the population-based methodology of Genetic Progra...
168
click to vote
PPAM
2007
Springer
16 years 9 days ago
2007
Springer
Abstract. The paper describes an application of Parallel Simulated Annealing (PSA) for solving one of the most studied NP-hard optimization problems: Graph Coloring Problem (GCP). ...
177
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
157
click to vote
VLSID
2003
IEEE
16 years 6 months ago
2003
IEEE
In the previous work, the problem of nding gate delays to eliminate glitches has been solved by linear programs (LP) requiring an exponentially large number ofconstraints. By intr...
166
click to vote
IPPS
2006
IEEE
16 years 6 days ago
2006
IEEE
This work proposes a parallel memetic algorithm applied to the total tardiness single machine scheduling problem. Classical models of parallel evolutionary algorithms and the gene...