ASED ABSTRACTION-REFINEMENT FRAMEWORK FOR MARKOV DECISION PROCESSES Mark Kattenbelt Marta Kwiatkowska Gethin Norman David Parker CL-RR-08-06 Oxford University Computing Laborator...
Mark Kattenbelt, Marta Z. Kwiatkowska, Gethin Norm...
Overlapping communication with computation is a well-known technique to increase application performance. While it is commonly assumed that communication and computation can be ov...
Barbara Kreaseck, Larry Carter, Henri Casanova, Je...
We develop a notion of predicate transformer and, in particular, the weakest precondition, appropriate for quantum computation. We show that there is a Stone-type duality between ...
: We study additive distances and quasi-distances between words. We show that every additive distance is finite. We then prove that every additive quasi-distance is regularity-pres...
We propose an efficient and deterministic algorithm for computing the one-dimensional dilation and erosion (max and min) sliding window filters. For a p-element sliding window, our...