Sciweavers

172 search results - page 32 / 35
» Finding Optimal Addition Chains Using a Genetic Algorithm Ap...
Sort
View
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
BMCBI
2008
102views more  BMCBI 2008»
13 years 7 months ago
Improving protein function prediction methods with integrated literature data
Background: Determining the function of uncharacterized proteins is a major challenge in the post-genomic era due to the problem's complexity and scale. Identifying a protein...
Aaron Gabow, Sonia M. Leach, William A. Baumgartne...
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
13 years 11 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
CVPR
2009
IEEE
14 years 1 months ago
Catadioptric Projectors
We present a catadioptric projector analogous to a catadioptric camera by combining a commodity digital projector with additional optical units. We show that, by using specially sh...
Yuanyuan Ding, Jing Xiao, Kar-Han Tan, Jingyi Yu
UAI
2008
13 years 9 months ago
Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
Richard S. Sutton, Csaba Szepesvári, Alborz...