4110 search results - page 209 / 822 » Efficient algorithms for the 2-gathering problem |
228
click to vote
CPM
1998
Springer
15 years 10 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
166
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
164
click to vote
IJCAI
1989
15 years 7 months ago
1989
One of the major issues confronting case-based reasoning (CBR) is rapid retrieval of similar cases from a large case base. This paper describes three algorithms which address this...
208
click to vote
NN
2000
Springer
15 years 6 months ago
2000
Springer
Piecewise-linear (PWL) neural networks are widely known for their amenability to digital implementation. This paper presents a new algorithm for learning in PWL networks consistin...
207
click to vote
NC
1998
15 years 7 months ago
1998
In this paper we introduce an efficient implementation of asynchronously parallel genetic algorithm with adaptive genetic operators. The classic genetic algorithm paradigm is exte...