2107 search results - page 163 / 422 » Computing Small Search Numbers in Linear Time |
123
Voted
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
Evolutionary and genetic algorithms (EAs and GAs) are quite successful randomized function optimizers. This success is mainly based on the interaction of different operators like ...
147
Voted
DAC
2009
ACM
16 years 4 months ago
2009
ACM
In this paper, a design method for automotive architectures is proposed. The two main technical contributions are (i) a novel hardware/software architecture encoding that unifies ...
137
Voted
IS
2008
15 years 3 months ago
2008
Performing data mining tasks in streaming data is considered a challenging research direction, due to the continuous data evolution. In this work, we focus on the problem of clust...
87
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
The cornerstone of any algorithm computing all repetitions in a string of length n in O(n) time is the fact that the number of runs (or maximal repetitions) is O(n). We give a simp...
150
Voted
IFIPTCS
2000
15 years 7 months ago
2000
We present an index to search a two-dimensional pattern of size m m in a two-dimensional text of size n n, even when the pattern appears rotated in the text. The index is based on ...