4372 search results - page 105 / 875 » Algorithmic Theories of Everything |
ICMLA
2008
13 years 10 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...
FSTTCS
1999
Springer
14 years 1 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...
GECCO
2008
Springer
13 years 10 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...
ICASSP
2010
IEEE
13 years 9 months ago
2010
IEEE
We propose two novel algorithms based on compressed-sensing theory to estimate and cancel narrow band interference (NBI) in orthogonal frequency division multiplexing (OFDM) syste...
SIAMCOMP
1998
13 years 8 months ago
1998
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...