61 search results - page 4 / 13 » DFM: where's the proof of value |
ESOP
2000
Springer
13 years 11 months ago
2000
Springer
We introduce graph reduction technology that implements functional languages with control, such as Scheme with call/cc, where continuations can be manipulated explicitly as values,...
SIAMJO
2010
13 years 5 months ago
2010
The imposition of general disjunctions of the form “πx ≤ π0 ∨ πx ≥ π0 + 1”, where π, π0 are integer valued, is a fundamental operation in both the branch-and-bound...
POPL
2006
ACM
14 years 7 months ago
2006
ACM
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
The AdaBoost algorithm was designed to combine many “weak” hypotheses that perform slightly better than random guessing into a “strong” hypothesis that has very low error....
ML
2000
ACM
13 years 7 months ago
2000
ACM
Existing methods for exploiting awed domain theories depend on the use of a su ciently large set of training examples for diagnosing and repairing aws in the theory. In this paper,...