One implementation of PL prover algorithm
Tatjana Timotijević (2001)
Kragujevac Journal of Mathematics
Similarity:
Tatjana Timotijević (2001)
Kragujevac Journal of Mathematics
Similarity:
Jan Vinař (1966)
Kybernetika
Similarity:
Karel Čulík (1972)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Nedeljko Ostojić, Dušan Starčević (2000)
The Yugoslav Journal of Operations Research
Similarity:
Peng Wuliang, Huang Min, Hao Yongping (2014)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Many real-world scheduling problems can be modeled as Multi-mode Resource Constrained Project Scheduling Problems (MRCPSP). However, the MRCPSP is a strong NP-hard problem and very difficult to be solved. The purpose of this research is to investigate a more efficient alternative based on ant algorithm to solve MRCPSP. To enhance the generality along with efficiency of the algorithm, the rule pool is designed to manage numerous priority rules for MRCPSP. Each ant is provided with an...
Vladimir Jovičić, Zora Konjović (1997)
The Yugoslav Journal of Operations Research
Similarity:
Krystyna Jerzykiewicz (1970)
Applicationes Mathematicae
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...
A. Adrabiński, J. Grabowski (1977)
Applicationes Mathematicae
Similarity: