8132 search results - page 314 / 1627 » Dependability, Abstraction, and Programming |
173
click to vote
TPHOL
1994
IEEE
15 years 11 months ago
1994
IEEE
Verification Condition Generator (VCG) tools have been effective in simplifying the task of proving programs correct. However, in the past these VCG tools have in general not thems...
167
click to vote
NIPS
2007
15 years 8 months ago
2007
We present an algorithm called Optimistic Linear Programming (OLP) for learning to optimize average reward in an irreducible but otherwise unknown Markov decision process (MDP). O...
162
Voted
CSC
2006
15 years 8 months ago
2006
: This work is about an algorithm for solving a linear program which is simple to apply. There are three algorithms in this work. The first algorithm solves a two-variable linear p...
176
click to vote
ICFP
2006
ACM
16 years 6 months ago
2006
ACM
Monads are widely used in Haskell for modeling computational effects, but defining monads remains a daunting challenge. Since every part of a monad's definition depends on it...
175
click to vote
RTAS
2007
IEEE
16 years 1 months ago
2007
IEEE
Discrete-event (DE) models are formal system specifications that have analyzable deterministic behaviors. Using a global, consistent notion of time, DE components communicate via...