Results 1  10
of
80
Bitwise Encoding of Finite State Machines
 Proc. 7th Conf. on VLSI Design
, 1994
"... We propose an innovative method of encoding the states of finite state machines. Our approach consists of iteratively defining the code word, one bit at a time. In each iteration the input state machine is decomposed into two submachines, with the first submachine having only two states. One bit is ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We propose an innovative method of encoding the states of finite state machines. Our approach consists of iteratively defining the code word, one bit at a time. In each iteration the input state machine is decomposed into two submachines, with the first submachine having only two states. One bit
Bitwise Regularity and GAHardness.
, 1998
"... We present in this paper a theoretical analysis that relates an irregularity measure of a fitness function to the socalled GAdeception. This approach is a continuation of a work [18] that has presented a deception analysis of Hölder functions. The analysis developed here is a generalization of thi ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
of this work in two ways: we first use a "bitwise regularity" instead of a Höder exponent as a basis for our deception analysis, second, we perform a similar deception analysis of a GA with uniform crossover. We finally propose to use the bitwise regularity coefficients in order to analyze
Dimension Encoding for Bitwise Dimensional CoClustering
"... skewresistant balanced dimensions for our clustering scheme Bitwise Dimensional CoClustering (short BDCC) based on histograms and HuTucker encoding. This is needed to avoid unreliable precision in BDCCscan when scanning tables at different granularities. I. ..."
Abstract
 Add to MetaCart
skewresistant balanced dimensions for our clustering scheme Bitwise Dimensional CoClustering (short BDCC) based on histograms and HuTucker encoding. This is needed to avoid unreliable precision in BDCCscan when scanning tables at different granularities. I.
1Bitwise Regularity and GAHardness.
"... AbstractWe present in this paper a theoretical analysis that relates an irregularity measure of a tness function to the socalled GAdeception. This approach is a continuation of a work [18] that has presented a deception analysis of Holder functions. The analysis developed here is a generalizati ..."
Abstract
 Add to MetaCart
chromosome encoding on the GA eciency, and we present experiments with Gray encoding. KeywordsGenetic Algorithms, optimization, bitwise regularity, deception analysis, fractals, Holder functions. I. Introduction.
NonMalleable Coding Against Bitwise and SplitState Tampering
"... Nonmalleable coding, introduced by Dziembowski, Pietrzak and Wichs (ICS 2010), aims for protecting the integrity of information against tampering attacks in situations where errordetection is impossible. Intuitively, information encoded by a nonmalleable code either decodes to the original messag ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
of tampering functions; namely, bitwise tampering functions (where the adversary tampers each bit of the encoding independently) and the much more general class of splitstate adversaries (where two independent adversaries arbitrarily tamper each half of the encoded sequence). We obtain the following results
Bitwise regularity coefficients as a tool for deception analysis of a Genetic Algorithm
, 1997
"... We present in this paper a theoretical analysis that relates an irregularity measure of a fitness function to the socalled GAdeception. This approach is a continuation of a work that has presented a deception analysis of Hölder functions. The analysis developed here is a generalization of this wor ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
of this work in two ways: we first use a "bitwise regularity" instead of a Hölder exponent as a basis for our deception analysis, second, we perform a similar deception analysis of a GA with uniform crossover. We finally propose to use the bitwise regularity coefficients in order to analyze
An Efficient Text Compression Technique Based on Using Bitwise LempelZiv Algorithm
, 2010
"... Abstract: This paper presents an efficient data compression technique based on using LempelZiv coding algorithms such as the LZ78 algorithm. The conventional LZ78 algorithm was applied directly to a nonbinary information source (i.e., original source) with a large number of alphabets (such as 2 ..."
Abstract
 Add to MetaCart
show that the bitwise LZ78 encoder of the fourthorder extended binary source, which includes 16 symbols, achieves compression efficiency close to that of the conventional LZ78 encoder, which includes 256 symbols.
A Novel BitWise Adaptable Entropy Coding Technique
"... Abstract We present a novel entropy coding technique which is adaptable in that each bit to be encoded may have an associated probability estimate which depends on previously encoded bits. The technique may have advantages over arithmetic coding. The technique can achieve arbitrarily small redun ..."
Abstract
 Add to MetaCart
Abstract We present a novel entropy coding technique which is adaptable in that each bit to be encoded may have an associated probability estimate which depends on previously encoded bits. The technique may have advantages over arithmetic coding. The technique can achieve arbitrarily small
NonMalleable Coding Against Bitwise and SplitState Tampering
"... Nonmalleable coding, introduced by Dziembowski, Pietrzak and Wichs (ICS 2010), aims for protecting the integrity of information against tampering attacks in situations where errordetection is impossible. Intuitively, information encoded by a nonmalleable code either decodes to the original mess ..."
Abstract
 Add to MetaCart
of tampering functions; namely, bitwise tampering functions (where the adversary tampers each bit of the encoding independently) and the much more general class of splitstate adversaries (where two independent adversaries arbitrarily tamper each half of the encoded sequence). We obtain the following
The Effects of Constant and BitWise Neutrality on Problem Hardness, Fitness Distance Correlation and Phenotypic Mutation Rates
"... Kimura’s neutral theory of evolution has inspired researchers from the evolutionary computation community to incorporate neutrality into Evolutionary Algorithms (EAs) in the hope that it can aid evolution. The effects of neutrality on evolutionary search have been considered in a number of studies, ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
distributed in the whole search space — and bitwise neutrality, where each phenotypic bit is obtained by transforming a group of genotypic bits via an encoding function. We study these forms of neutrality both theoretically and empirically (both for standard benchmark functions and a class of random MAX
Results 1  10
of
80