Sciweavers

29 search results - page 4 / 6
» Closing the Gap Between Runtime Complexity and Polytime Comp...
Sort
View
ECBS
2005
IEEE
160views Hardware» more  ECBS 2005»
15 years 3 months ago
Traceability-Driven Model Refinement for Test Case Generation
Testing complex Computer-Based Systems is not only a demanding but a very critical task. Therefore the use of models for generating test data is an important goal. Tool support du...
Matthias Riebisch, Michael Hübner
CSL
2010
Springer
14 years 10 months ago
Quantified Differential Dynamic Logic for Distributed Hybrid Systems
Abstract. We address a fundamental mismatch between the combinations of dynamics that occur in complex physical systems and the limited kinds of dynamics supported in analysis. Mod...
André Platzer
EICS
2009
ACM
15 years 3 months ago
Edit, inspect and connect your surroundings: a reference framework for meta-UIs
Discovering and unlocking the full potential of complex pervasive environments is still approached in application-centric ways. A set of statically deployed applications often deļ...
Geert Vanderhulst, Daniel Schreiber, Kris Luyten, ...
SODA
2004
ACM
104views Algorithms» more  SODA 2004»
14 years 10 months ago
Tight bounds for the partial-sums problem
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
Mihai Patrascu, Erik D. Demaine
ACMSE
2004
ACM
15 years 2 months ago
Performance evaluation of cache replacement policies for the SPEC CPU2000 benchmark suite
Replacement policy, one of the key factors determining the effectiveness of a cache, becomes even more important with latest technological trends toward highly associative caches....
Hussein Al-Zoubi, Aleksandar Milenkovic, Milena Mi...