B-Tree Algorithm Complexity Analysis to Evaluate the Feasibility of its Application in the University Course Timetabling Problem Cover

.blurhash-client-img { display: none !important; }

B-Tree Algorithm Complexity Analysis to Evaluate the Feasibility of its Application in the University Course Timetabling Problem

Journal of Artificial Intelligence and Soft Computing Research

Volume 3 (2013): Issue 4 (October 2013)

By: Marco Antonio Cruz Chvez and Alina Martnez Oropeza

Open Access

|Dec 2014

Download Article

Download the full article as a PDF file.

DOI: https://doi.org/10.2478/jaiscr-2014-0018

Journal RSS Feed

Language: English

Page range: 251 - 263

Published on: Dec 30, 2014

Published by: SAN University

In partnership with: Paradigm Publishing Services

Publication frequency: 4 issues per year

Related subjects:

Computer sciences,

Artificial intelligence,

Databases and data mining

© 2014 Marco Antonio Cruz Chvez, Alina Martnez Oropeza, published by SAN University
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Previous article Volume 3 (2013): Issue 4 (October 2013)Next article