Sciweavers

104 search results - page 15 / 21
» The Gray Code
Sort
View
GECCO
2004
Springer
14 years 1 months ago
Improving the Locality Properties of Binary Representations
Abstract. Choosing representations and operators that preserve locality between genotype and phenotype space is an important goal in EA design. In the GA literature there has been ...
Adrian Grajdeanu, Kenneth A. De Jong
AAECC
2006
Springer
133views Algorithms» more  AAECC 2006»
13 years 7 months ago
On the low hamming weight discrete logarithm problem for nonadjacent representations
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
James A. Muir, Douglas R. Stinson
FUIN
1998
135views more  FUIN 1998»
13 years 7 months ago
A Study on Partitioned Iterative Function Systems for Image Compression
The technique of image compression using Iterative Function System (IFS) is known as fractal image compression. An extension of IFS theory is called as Partitioned or local Iterati...
Suman K. Mitra, C. A. Murthy, Malay Kumar Kundu
SPE
2002
115views more  SPE 2002»
13 years 7 months ago
D'Agents: Applications and performance of a mobile-agent system
D'Agents is a general-purpose mobile-agent system that has been used in several informationretrieval applications. In this paper, we first examine one such application, opera...
Robert S. Gray, George Cybenko, David Kotz, Ronald...
DCC
1999
IEEE
13 years 12 months ago
Complexity-Distortion Tradeoffs in Vector Matching Based on Probabilistic Partial Distance Techniques
In this paper we consider the problem of searching for the best match for an input among a set of vectors, according to some predetermined metric. Examples of this problem include...
Krisda Lengwehasatit, Antonio Ortega