Sciweavers

9405 search results - page 254 / 1881
» Computing a Model of Set Theory
Sort
View
LICS
2009
IEEE
16 years 1 months ago
On the Computational Complexity of Verifying One-Counter Processes
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
Stefan Göller, Richard Mayr, Anthony Widjaja ...
JCAMD
2010
34views more  JCAMD 2010»
15 years 5 months ago
SAMPL2 and continuum modeling
An account is given of our contributions to the SAMPL2 challenge for vacuum-water transfer energies. These contributions include different charge sets and radii used with Poisson...
Anthony Nicholls, Stanislaw Wlodek, J. Andrew Gran...
MODELS
2009
Springer
16 years 1 months ago
Modeling Modeling
Abstract. Model-driven engineering and model-based approaches have permeated all branches of software engineering; to the point that it seems that we are using models, as Molière...
Pierre-Alain Muller, Frédéric Fondem...
PLDI
2003
ACM
15 years 12 months ago
Compile-time dynamic voltage scaling settings: opportunities and limits
With power-related concerns becoming dominant aspects of hardware and software design, significant research effort has been devoted towards system power minimization. Among run-t...
Fen Xie, Margaret Martonosi, Sharad Malik
DC
2000
15 years 6 months ago
Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
ms, to use abstraction mappings to prove probabilistic properties, and to apply random walk theory in a distributed computational setting. We apply all of these techniques to analy...
Anna Pogosyants, Roberto Segala, Nancy A. Lynch