Results 1  10
of
178,553
Binary Strings
 Handbook of Evolutionary Computation, chapter C 1.2. IOP Publishing Ltd and
, 1997
"... Binary vectors of fixed length, the standard representation of solutions within canonical genetic algorithms, are discussed in this section, with some emphasis on the question of whether this representation should also be used for problems where the search space fundamentally differs from the space ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
representation used in socalled canonical genetic algorithms consists of binary vectors (often B1.2 called bitstrings or binary strings) of fixed length ℓ; that is, the individual space I is given by I ={0,1} ℓ and individuals a ∈ I are denoted as binary vectors a = (a1,...,aℓ)∈{0,1} ℓ (see the book by Goldberg
Building Kernels from Binary Strings
"... Paper Title: Building kernels from binary strings for image matching ..."
TraitorTracing on Binary Strings
"... Abstract. Codes with the Identifiable Parent Property (IPP) have been studied in the context of traitor tracing; such codes can be used to enable a data supplier to determine the origin of pirated data. We consider an analogous property for a set of binary strings S: if a new string τ is formed by c ..."
Abstract
 Add to MetaCart
Abstract. Codes with the Identifiable Parent Property (IPP) have been studied in the context of traitor tracing; such codes can be used to enable a data supplier to determine the origin of pirated data. We consider an analogous property for a set of binary strings S: if a new string τ is formed
UNPREDICTABLE BINARY STRINGS
"... Abstract. We examine a class of binary strings arising from considerations about stream cipher encryption: to what degree can one guarantee that the number of pairs of entries distance k apart that disagree is equal to the number that agree, for all small k? In a certain sense, a keystream with such ..."
Abstract
 Add to MetaCart
Abstract. We examine a class of binary strings arising from considerations about stream cipher encryption: to what degree can one guarantee that the number of pairs of entries distance k apart that disagree is equal to the number that agree, for all small k? In a certain sense, a keystream
Visualization of Binary String . . .
 IN
, 1996
"... Understanding the evolution of a complex genetic algorithm is a nontrivial problem, however, geneticalgorithm visualization is in its infancy. This paper reviews some of the current approaches and presents a new visualization approach based on Sammon mapping. Sammon mapping is a nonlinear mapping o ..."
Abstract
 Add to MetaCart
of a set of vectors in pdimensional space to a set in rdimensional space, where r < p. The mapping attempts to preserve in rspace the Euclidean intervector distances present in pspace. We demonstrate that a Sammon mapping to 2space of binary chromosomes present in a higherdimensional allele
Efficient pattern matching on binary strings
 In Current Trends in Theory and Practice of Computer Science
, 2009
"... The binary string matching problem is an interesting problem in computer science, since binary data are omnipresent in telecom and computer network applications. The main reason for using binaries is size. A binary is a much more compact format than the symbolic or textual representation of the same ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
The binary string matching problem is an interesting problem in computer science, since binary data are omnipresent in telecom and computer network applications. The main reason for using binaries is size. A binary is a much more compact format than the symbolic or textual representation
CIRCULAR BINARY STRINGS WITHOUT ZIGZAGS
"... We study several enumerative properties of the set of all circular binary strings without zigzags and of the set of all (0; 1)necklaces without zigzags, where a zigzag is a 1 followed and preceded by a 0 or a 0 followed and preceded by a 1. 1. ..."
Abstract
 Add to MetaCart
We study several enumerative properties of the set of all circular binary strings without zigzags and of the set of all (0; 1)necklaces without zigzags, where a zigzag is a 1 followed and preceded by a 0 or a 0 followed and preceded by a 1. 1.
Parameterized Suffix Arrays for Binary Strings
"... Abstract. We consider the suffix array for parameterized binary strings that consist of only two types of parameter symbols. We show that the parameterized suffix array, as well as its longest common prefix (LCP) array of such strings can be constructed in linear time. The construction is direct, in ..."
Abstract
 Add to MetaCart
Abstract. We consider the suffix array for parameterized binary strings that consist of only two types of parameter symbols. We show that the parameterized suffix array, as well as its longest common prefix (LCP) array of such strings can be constructed in linear time. The construction is direct
Results 1  10
of
178,553