Sciweavers

6719 search results - page 423 / 1344
» A Generalization of Automatic Sequences
Sort
View
EUROCRYPT
2006
Springer
15 years 10 months ago
How to Strengthen Pseudo-random Generators by Using Compression
Sequence compression is one of the most promising tools for strengthening pseudo-random generators used in stream ciphers. Indeed, adding compression components can thwart algebrai...
Aline Gouget, Hervé Sibert
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
15 years 10 months ago
Instance similarity and the effectiveness of case injection in a genetic algorithm for binary quadratic programming
When an evolutionary algorithm addresses a sequence of instances of the same problem, it can seed its population with solutions that it found for previous instances. This techniqu...
Jason Amunrud, Bryant A. Julstrom
GECCO
2006
Springer
282views Optimization» more  GECCO 2006»
15 years 10 months ago
A genetic algorithm for the longest common subsequence problem
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...
Brenda Hinkemeyer, Bryant A. Julstrom
STOC
1995
ACM
115views Algorithms» more  STOC 1995»
15 years 10 months ago
Geometric lower bounds for parametric matroid optimization
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
David Eppstein
BIRTHDAY
2008
Springer
15 years 9 months ago
Linear Recurrence Relations for Graph Polynomials
A sequence of graphs Gn is iteratively constructible if it can be built from an initial labeled graph by means of a repeated fixed succession of elementary operations involving add...
Eldar Fischer, Johann A. Makowsky