140 search results - page 20 / 28 » String Quartets In Binary |
EUROGP
2001
Springer
14 years 1 days ago
2001
Springer
In this paper, firstly we specialise the exact GP schema theorem for one-point crossover to the case of linear structures of variable length, for example binary strings or program...
DIALM
2000
ACM
13 years 11 months ago
2000
ACM
This paper presents an efficient collision resolution protocol and its variations for the tag identification problem, where an electromagnetic reader attempts to obtain within its...
FOGA
2007
13 years 9 months ago
2007
Geometric crossover is a representation-independent generalization of traditional crossover for binary strings. It is defined using the distance associated to the search space in ...
JSYML
2006
13 years 7 months ago
2006
Levin and Schnorr (independently) introduced the monotone complexity, Km(), of a binary string . We use monotone complexity to define the relative complexity (or relative randomnes...
MFCS
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. What is information? Frequently spoken about in many contexts, yet nobody has ever been able to define it with mathematical rigor. The best we are left with so far is th...