Given n fragments from k > 2 genomes, we will show how to find an optimal chain of colinear non-overlapping fragments in time O(n logk−2 n log log n) and space O(n logk−2 n...
The application of Artificial Intelligence described in this article is intended to resolve the issue of speculation on the stock market. Genetic Algorithms is the technique that ...
David de la Fuente, Alejandro Garrido, Jaime Lavia...
In this paper, an efficient algorithm is presented for solving the 2-D optimization problem which is associated with computing the robustness measures of a number of linear time-in...
The resource-constrained project scheduling problem with time windows (RCPSP/max) is an important generalization of a number of well studied scheduling problems. In this paper, we...
: This paper presents a graph-coloring-based algorithm for the exam scheduling application, with the objective of achieving fairness, accuracy, and optimal exam time period. Throug...
Mohammad Malkawi, Mohammad Al-Haj Hassan, Osama Al...