146 search results - page 19 / 30 » The Complexity of Integer Bound Propagation |
105
click to vote
ICML
2001
IEEE
15 years 10 months ago
2001
IEEE
This work is concerned with the estimation of a classifier's accuracy. We first review some existing methods for error estimation, focusing on cross-validation and bootstrap,...
WEA
2010
Springer
15 years 4 months ago
2010
Springer
Resource leveling is a variant of resource-constrained project scheduling in which a non-regular objective function, the resource availability cost, is to be minimized. We present ...
SAS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In his seminal paper [5], Granger presents an analysis which infers linear congruence relations between integer variables. For affine programs without guards, his analys...
76
Voted
ISSAC
2004
Springer
15 years 3 months ago
2004
Springer
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
CSJM
2006
14 years 9 months ago
2006
Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined -- a synthesis of classical TS...