15033 search results - page 403 / 3007 » Complexity Theory and Algorithms |
220
click to vote
ICIC
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. In this paper, a general framework of quantum-inspired multiobjective evolutionary algorithms is proposed based on the basic principles of quantum computing and general s...
214
click to vote
ICMLA
2008
15 years 9 months ago
2008
In evolving applications, there is a need for the dynamic selection of algorithms or algorithm parameters. Such selection is hardly ever governed by exact theory, so intelligent r...
222
click to vote
FSTTCS
1999
Springer
15 years 12 months ago
1999
Springer
Abstract. Shop scheduling problems are known to be notoriously intractable, both in theory and practice. In this paper we give a randomized approximation algorithm for flow shop s...
166
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
This paper aims to identify the missing links from theory of Genetic Algorithms (GAs) to application of GAs. Categories and Subject Descriptors: J.0 [Computer Applications]: Gener...
136
click to vote
STACS
2010
Springer
16 years 2 months ago
2010
Springer
Research on parameterized algorithmics for NP-hard problems has steadily grown over the last years. We survey and discuss how parameterized complexity analysis naturally develops i...