417 search results - page 22 / 84 » Running Time Predictions for Factoring Algorithms |
INFORMS
2006
14 years 9 months ago
2006
This paper intends to show that the time needed to solve mixed integer programming problems by branch and bound can be roughly predicted early in the solution process. We construc...
75
Voted
SAT
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Recently Schuler [17] presented a randomized algorithm that solves SAT in expected time at most 2n(1−1/ log2(2m)) up to a polynomial factor, where n and m are, respecti...
KDD
2002
ACM
15 years 10 months ago
2002
ACM
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
QOSA
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Software performance prediction methods are typically validated by taking an appropriate software system, performing both performance predictions and performance measurem...