429 search results - page 19 / 86 » Solving the Maximum Clique Problem Using PUBB |
ALGORITHMICA
2004
13 years 7 months ago
2004
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
UAI
2004
13 years 9 months ago
2004
Within the task of collaborative filtering two challenges for computing conditional probabilities exist. First, the amount of training data available is typically sparse with resp...
TCBB
2008
13 years 7 months ago
2008
Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new adva...
ATMOS
2007
13 years 9 months ago
2007
The optimal track allocation problem (OPTRA) is to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programmi...
PAMI
2006
13 years 7 months ago
2006
Nonparametric neighborhood methods for learning entail estimation of class conditional probabilities based on relative frequencies of samples that are "near-neighbors" of...