- Tytuł:
- B-TREE algorithm complexity analysis to evaluate the feasibility of its application in the university course timetabling problem
- Autorzy:
-
Cruz Chávez, M. A.
Martínez Oropeza, A. - Powiązania:
- https://bibliotekanauki.pl/articles/91757.pdf
- Data publikacji:
- 2013
- Wydawca:
- Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
- Tematy:
-
B-TREE
algorithm
Binary Search Algorithms
complexity analysis
University Course Timetabling Problem
UCTP - Opis:
- This paper presents a comparative analysis of complexity between the B-TREE and the Binary Search Algorithms, both theoretically and experimentally, to evaluate their efficiency in finding overlap of classes for students and teachers in the University Course Timetabling Problem (UCTP). According to the theory, B-TREE Search complexity is lower than Binary Search. The performed experimental tests showed the B-TREE Search Algorithm is more efficient than Binary Search, but only using a dataset larger than 75 students per classroom.
- Źródło:
-
Journal of Artificial Intelligence and Soft Computing Research; 2013, 3, 4; 251-263
2083-2567
2449-6499 - Pojawia się w:
- Journal of Artificial Intelligence and Soft Computing Research
- Dostawca treści:
- Biblioteka Nauki
Artykuł