421 search results - page 34 / 85 » String Distances and Uniformities |
108
click to vote
CC
2006
Springer
15 years 4 months ago
2006
Springer
Variants of Kannan's Theorem are given where the circuits of the original theorem are replaced by arbitrary recursively presentable classes of languages that use advice string...
121
click to vote
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
This paper assumes a search space of fixed-length strings, where the size of the alphabet can vary from position to position. Structural crossover is mask-based crossover, and thu...
129
click to vote
ICPP
1998
IEEE
15 years 8 months ago
1998
IEEE
We address the problems of I/O scheduling and buffer management for general reference strings in a parallel I/O system. Using the standard parallel disk model withD disks and a sh...
140
click to vote
CEC
2010
IEEE
15 years 5 months ago
2010
IEEE
The Nelder-Mead Algorithm (NMA) is an almost half-century old method for numerical optimization, and it is a close relative of Particle Swarm Optimization (PSO) and Differential Ev...
135
click to vote
ACL
1996
15 years 5 months ago
1996
Charts constitute a natural uniform architecture for parsing and generation provided string position is replaced by a notion more appropriate to logical forms and that measures ar...