Sciweavers

Share
PE
2011
Springer
214views Optimization» more  PE 2011»
8 years 10 months ago
Time-bounded reachability in tree-structured QBDs by abstraction
Structured QBDs by Abstraction Daniel Klink, Anne Remke, Boudewijn R. Haverkort, Fellow, IEEE, and Joost-Pieter Katoen, Member, IEEE Computer Society —This paper studies quantita...
Daniel Klink, Anne Remke, Boudewijn R. Haverkort, ...
ENTCS
2010
88views more  ENTCS 2010»
9 years 1 months ago
Range and Set Abstraction using SAT
d Set Abstraction using SAT Edd Barrett Andy King School of Computing, University of Kent, CT2 7NF, UK Symbolic decision trees are not the only way to correlate the relationship b...
Edd Barrett, Andy King
CLUSTER
2010
IEEE
9 years 1 months ago
Harnessing parallelism in multicore clusters with the All-Pairs, Wavefront, and Makeflow abstractions
All-Pairs, Wavefront, and Makeflow Abstractions Li Yu
Li Yu, Christopher Moretti, Andrew Thrasher, Scott...
DSONLINE
2006
108views more  DSONLINE 2006»
9 years 3 months ago
Middleware for Protocol-Based Coordination in Mobile Applications
We propose extending these middleware approaches with suitable abstractions to better support protocolbased interaction in mobile applications. To test our approach, we created Obj...
Kurt Schelfthout, Danny Weyns, Tom Holvoet
ECAI
2010
Springer
9 years 4 months ago
Relative-Order Abstractions for the Pancake Problem
-Order Abstractions for the Pancake Problem Malte Helmert and Gabriele R
Malte Helmert, Gabriele Röger
DAGSTUHL
2003
9 years 5 months ago
Organising Computation through Dynamic Grouping
Abstract. There are a range of abstractions used for both modelling and proof modern computational systems. While these abstractions may have been devised for specific purposes, t...
Michael Fisher, Chiara Ghidini, Benjamin Hirsch
FAST
2004
9 years 5 months ago
MEMS-based Storage Devices and Standard Disk Interfaces: A Square Peg in a Round Hole?
MEMS-based storage devices (MEMStores) are significantly different from both disk drives and semiconductor memories. The differences motivate the queswhether they need new abstrac...
Steven W. Schlosser, Gregory R. Ganger
AAAI
2008
9 years 6 months ago
Expectation-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using
ion-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using Poker Andrew Gilpin and Tuomas Sandholm Computer Science Dep...
Andrew Gilpin, Tuomas Sandholm
EUROPAR
2006
Springer
9 years 7 months ago
Specification of Inefficiency Patterns for MPI-2 One-Sided Communication
Abstract. Automatic performance analysis of parallel programs can be accomplished by scanning event traces of program execution for patterns representing inefficient behavior. The ...
Andrej Kühnal, Marc-André Hermanns, Be...
PPOPP
1990
ACM
9 years 7 months ago
Concurrent Aggregates (CA)
Toprogrammassivelyconcurrent MIMDmachines, programmersneed tools for managingcomplexity. One important tool that has been used in the sequential programmingworld is hierarchies of...
Andrew A. Chien, William J. Dally
books