1058 search results - page 74 / 212 » It's Doomed; We Can Prove It |
100
Voted
ICALP
2010
Springer
15 years 25 days ago
2010
Springer
Abstract. Given an ML function f : (int->int)->int how can we rigorously specify that f is pure, i.e., produces no side-effects other than those arising from calling its func...
CORR
2010
Springer
15 years 22 days ago
2010
Springer
We introduce a new online convex optimization algorithm that adaptively chooses its regularization function based on the loss functions observed so far. This is in contrast to pre...
82
Voted
ENTCS
2008
15 years 21 days ago
2008
: Countably based filter spaces have been suggested in the 1970's as a model for recursion theory on higher types. Weak limit spaces with a countable base are known to be the ...
118
click to vote
ENTCS
2008
15 years 21 days ago
2008
We report in this paper on the formal verification of a simple compiler for the C-like programming language C0. The compiler correctness proof meets the special requirements of pe...
92
Voted
CORR
2007
Springer
15 years 19 days ago
2007
Springer
Graphs are called navigable if one can find short paths through them using only local knowledge. It has been shown that for a graph to be navigable, its construction needs to mee...