Sciweavers

886 search results - page 30 / 178
» On the Autoreducibility of Random Sequences
Sort
View
GECCO
2005
Springer
154views Optimization» more  GECCO 2005»
14 years 1 months ago
Genetic algorithms using low-discrepancy sequences
The random number generator is one of the important components of evolutionary algorithms (EAs). Therefore, when we try to solve function optimization problems using EAs, we must ...
Shuhei Kimura, Koki Matsumura
DAGSTUHL
2006
13 years 9 months ago
The optimal sequence compression
This paper presents the optimal compression for sequences with undefined values. Let we have (N -m) undefined and m defined positions in the boolean sequence V of length N. The se...
Alexander E. Andreev
AAAI
2008
13 years 10 months ago
Hidden Dynamic Probabilistic Models for Labeling Sequence Data
We propose a new discriminative framework, namely Hidden Dynamic Conditional Random Fields (HDCRFs), for building probabilistic models which can capture both internal and external...
Xiaofeng Yu, Wai Lam
WONS
2012
IEEE
12 years 3 months ago
Obfuscating IEEE 802.15.4 communication using secret spreading codes
—The IEEE 802.15.4 standard specifies an M-ary spread spectrum system with public and fixed spreading sequences. We propose instead to use secret and dynamic, random spreading ...
Bjorn Muntwyler, Vincent Lenders, Franck Legendre,...
UAI
2004
13 years 9 months ago
Blind Construction of Optimal Nonlinear Recursive Predictors for Discrete Sequences
We present a new method for nonlinear prediction of discrete random sequences under minimal structural assumptions. We give a mathematical construction for optimal predictors of s...
Cosma Rohilla Shalizi, Kristina Lisa Shalizi