886 search results - page 10 / 178 » On the Autoreducibility of Random Sequences |
GECCO
2011
Springer
12 years 11 months ago
2011
Springer
Computing unique input-output sequences (UIOs) from finite state machines (FSMs) is important for conformance testing in software engineering, where evolutionary algorithms (EAs)...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
—Jamming resistance is crucial for applications where reliable wireless communication is required. Spread spectrum techniques such as Frequency Hopping Spread Spectrum (FHSS) and...
CSR
2006
Springer
13 years 11 months ago
2006
Springer
A central object of study in the field of algorithmic randomness are notions of randomness for sequences, i.e., infinite sequences of zeros and ones. These notions are usually def...
JOCN
2010
13 years 2 months ago
2010
There is growing evidence suggesting that synchronization changes in the oscillatory neuronal dynamics in the EEG or MEG reflect the transient coupling and uncoupling of functiona...
COMBINATORICS
2006
13 years 7 months ago
2006
We give a new derivation of the threshold of appearance of the k-core of a random graph. Our method uses a hybrid model obtained from a simple model of random graphs based on rand...