Sciweavers

135 search results - page 23 / 27
» String Noninclusion Optimization Problems
Sort
View
ESA
2008
Springer
136views Algorithms» more  ESA 2008»
14 years 11 months ago
Detecting Regular Visit Patterns
We are given a trajectory T and an area A. T might intersect A several times, and our aim is to detect whether T visits A with some regularity, e.g. what is the longest time span t...
Bojan Djordjevic, Joachim Gudmundsson, Anh Pham, T...
FOGA
2011
14 years 1 months ago
Approximating the distribution of fitness over hamming regions
The distribution of fitness values across a set of states sharply influences the dynamics of evolutionary processes and heuristic search in combinatorial optimization. In this p...
Andrew M. Sutton, Darrell Whitley, Adele E. Howe
LATIN
1998
Springer
15 years 1 months ago
Fast Two-Dimensional Approximate Pattern Matching
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
Ricardo A. Baeza-Yates, Gonzalo Navarro
GECCO
2006
Springer
218views Optimization» more  GECCO 2006»
15 years 1 months ago
Genetic programming with primitive recursion
When Genetic Programming is used to evolve arithmetic functions it often operates by composing them from a fixed collection of elementary operators and applying them to parameters...
Stefan Kahrs
PODS
2009
ACM
130views Database» more  PODS 2009»
15 years 10 months ago
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
Rasmus Pagh, Srinivasa Rao Satti