Abstract We compare the performance of two database selection algorithms reported in the literature. Their performance is compared using a common testbed designed specifically for ...
James C. French, Allison L. Powell, James P. Calla...
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
There are various web caching replacement algorithms related to reference characteristics of web objects were researched. They could be used in regard to user characteristics of c...
Abstract Data mining algorithms have been recently applied to software repositories to help on the maintenance of evolving software systems. In the past, information about what cla...
Lile Hattori, Gilson Pereira dos Santos Jr., Ferna...