Automatic run-time choice for simulation length in mimesis
M. Becker, A.-L. Beylot, G. Damm, W.-Y. Thang (1999)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
M. Becker, A.-L. Beylot, G. Damm, W.-Y. Thang (1999)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Dragan Matić (2010)
The Yugoslav Journal of Operations Research
Similarity:
Z. Cylkowski (1976)
Applicationes Mathematicae
Similarity:
Martinovic, Goran, Aleksi, Ivan, Baumgartner, Alfonzo (2008)
Mathematical Problems in Engineering
Similarity:
Aleksandar B. Samardžić, Dušan Starčević, Milan Tuba (2006)
The Yugoslav Journal of Operations Research
Similarity:
Thomas Berry, Somasundaram Ravindran (2002)
Kybernetika
Similarity:
In this paper we present experimental results for string matching algorithms which have a competitive theoretical worst case run time complexity. Of these algorithms a few are already famous for their speed in practice, such as the Boyer–Moore and its derivatives. We chose to evaluate the algorithms by counting the number of comparisons made and by timing how long they took to complete a given search. Using the experimental results we were able to introduce a new string matching algorithm...
Vladimir Jovičić, Zora Konjović (1997)
The Yugoslav Journal of Operations Research
Similarity:
Edmund Burke, Yuri Bykov, James Newall, Sanja Petrović (2003)
The Yugoslav Journal of Operations Research
Similarity:
Piotr Kulczycki, Szymon Łukasik (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Anna Bartkowiak (1975)
Applicationes Mathematicae
Similarity:
Zdeněk Režný, Josef Jirkovský (1983)
Aplikace matematiky
Similarity: