20294 search results - page 309 / 4059 » Algorithmic Information Theory |
193
click to vote
FSTTCS
1999
Springer
15 years 11 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...
136
click to vote
GECCO
2008
Springer
15 years 7 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...
152
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
We introduce a multi-stage ensemble framework, ErrorDriven Generalist+Expert or Edge, for improved classification on large-scale text categorization problems. Edge first trains a ...
158
click to vote
ICASSP
2010
IEEE
15 years 7 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...
188
click to vote
SIAMCOMP
1998
15 years 6 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 ...