3820 search results - page 161 / 764 » Bounded Model Debugging |
115
click to vote
WOSP
2004
ACM
15 years 8 months ago
2004
ACM
This paper describes how soft performance bounds can be expressed for software systems using stochastic probes over stochastic process algebra models. These stochastic probes are ...
126
click to vote
CORR
2002
Springer
15 years 2 months ago
2002
Springer
Abstract. We study algorithms for computing stable models of propositional logic programs and derive estimates on their worst-case performance that are asymptotically better than t...
114
click to vote
UC
2005
Springer
15 years 8 months ago
2005
Springer
We present a theoretical model for self-assembling tiles with flexible branches motivated by DNA branched junction molecules. We encode an instance of a “problem” as a pot of ...
116
Voted
IPPS
1997
IEEE
15 years 7 months ago
1997
IEEE
We present a new randomized sorting algorithm on the Bulk-SynchronousParallel (BSP) model. The algorithm improves upon the parallel slack of previous algorithms to achieve optimal...
122
click to vote
JPDC
2006
15 years 2 months ago
2006
Several schemes for checkpointing and rollback recovery have been reported in the literature. In this paper, we analyze some of these schemes under a stochastic model. We have der...