Sciweavers

12289 search results - page 483 / 2458
» computing 2006
Sort
View
180
Voted
FMSD
2010
77views more  FMSD 2010»
15 years 5 months ago
A game-based abstraction-refinement framework for Markov decision processes
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...
IJHPCA
2006
80views more  IJHPCA 2006»
15 years 6 months ago
Interference-Aware Scheduling
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...
MSCS
2006
89views more  MSCS 2006»
15 years 6 months ago
Quantum weakest preconditions
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 ...
Ellie D'Hondt, Prakash Panangaden
JUCS
2002
106views more  JUCS 2002»
15 years 6 months ago
Additive Distances and Quasi-Distances Between Words
: 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...
Cristian Calude, Kai Salomaa, Sheng Yu
PAMI
2002
164views more  PAMI 2002»
15 years 6 months ago
Efficient Dilation, Erosion, Opening, and Closing Algorithms
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...
Joseph Gil, Ron Kimmel