88 search results - page 8 / 18 » Proving the Correctness of the STG Machine |
102
Voted
ESA
2010
Springer
15 years 2 months ago
2010
Springer
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...
103
click to vote
ATVA
2004
Springer
15 years 7 months ago
2004
Springer
nded Abstract – Oleg Parshin∗ Abdur Rakib† Stephan Thesing∗ Reinhard Wilhelm∗ The precise determination of worst-case execution times (WCETs) for programs is mostly bein...
VSTTE
2010
Springer
14 years 11 months ago
2010
Springer
Garbage collectors are very hard to implement correctly due to their low-level manipulation of memory. In this paper, we construct a copying garbage collector which we have proved ...
95
Voted
IJBC
2007
15 years 1 months ago
2007
A Chaitin Omega number is the halting probability of a universal prefix-free Turing machine. Every Omega number is simultaneously computably enumerable (the limit of a computable...
ICML
2003
IEEE
16 years 2 months ago
2003
IEEE
We present a new type of multi-class learning algorithm called a linear-max algorithm. Linearmax algorithms learn with a special type of attribute called a sub-expert. A sub-exper...