Sciweavers

140 search results - page 26 / 28
» String Quartets In Binary
Sort
View
EC
1998
178views ECommerce» more  EC 1998»
14 years 11 months ago
The Simple Genetic Algorithm and the Walsh Transform: Part I, Theory
This paper is the first part of a two part series. It proves a number of direct relationships between the Fourier transform and the simple genetic algorithm. (For a binary repres...
Michael D. Vose, Alden H. Wright
CORR
1999
Springer
71views Education» more  CORR 1999»
14 years 11 months ago
New Error Bounds for Solomonoff Prediction
Solomonoff sequence prediction is a scheme to predict digits of binary strings without knowing the underlying probability distribution. We call a prediction scheme informed when i...
Marcus Hutter
TEC
2002
101views more  TEC 2002»
14 years 11 months ago
Quantum-inspired evolutionary algorithm for a class of combinatorial optimization
This paper proposes a novel evolutionary algorithm inspired by quantum computing, called a quantum-inspired evolutionary algorithm (QEA), which is based on the concept and principl...
Kuk-Hyun Han, Jong-Hwan Kim
APAL
2010
85views more  APAL 2010»
14 years 11 months ago
Elementary differences between the degrees of unsolvability and degrees of compressibility
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
George Barmpalias
STOC
2005
ACM
147views Algorithms» more  STOC 2005»
15 years 12 months ago
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sud...