Sciweavers

2152 search results - page 28 / 431
» A Comparative Study of 2QBF Algorithms
Sort
View
SIGIR
1999
ACM
14 years 6 hour ago
Comparing the Performance of Database Selection Algorithms
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...
AAAI
2000
13 years 9 months ago
Depth-First Branch-and-Bound versus Local Search: A Case Study
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...
Weixiong Zhang
HEURISTICS
2006
120views more  HEURISTICS 2006»
13 years 7 months ago
A study of ACO capabilities for solving the maximum clique problem
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 ...
Christine Solnon, Serge Fenet
JCIT
2008
78views more  JCIT 2008»
13 years 7 months ago
A Study on Web Caching based on Reference Characteristics of Web Objects
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...
Yun Ji Na, Sarvar R. Abdullaev, Il Seok Ko
SBBD
2008
183views Database» more  SBBD 2008»
13 years 9 months ago
Mining Software Repositories for Software Change Impact Analysis: A Case Study
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...