121 search results - page 7 / 25 » Improving branch-and-cut performance by random sampling |
FLAIRS
2007
15 years 25 days ago
2007
Many real-world domains present the problem of imbalanced data sets, where examples of one classes significantly outnumber examples of other classes. This makes learning difficu...
PODC
2009
ACM
15 years 11 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
ICPR
2004
IEEE
15 years 11 months ago
2004
IEEE
In this paper, a new selective sampling method for the active learning framework is presented. Initially, a small training set ? and a large unlabeled set ? are given. The goal is...
NIPS
2007
14 years 12 months ago
2007
Rosetta is one of the leading algorithms for protein structure prediction today. It is a Monte Carlo energy minimization method requiring many random restarts to find structures ...
JAL
2008
14 years 10 months ago
2008
An important class of heuristics for constraint satisfaction problems works by sampling information during search in order to inform subsequent decisions. One of these strategies, ...