3820 search results - page 88 / 764 » Bounded Model Debugging |
106
click to vote
QEST
2006
IEEE
15 years 8 months ago
2006
IEEE
The time-bounded reachability problem for continuoustime Markov chains (CTMCs) amounts to determine the probability to reach a (set of) goal state(s) within a given time span, suc...
141
click to vote
LICS
2006
IEEE
15 years 8 months ago
2006
IEEE
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...
115
Voted
ATAL
2004
Springer
15 years 7 months ago
2004
Springer
We propose a context-logic style formalism, Timed Reasoning Logics (TRL), to describe resource-bounded reasoners who take time to derive consequences of their knowledge. The seman...
ESA
2003
Springer
15 years 7 months ago
2003
Springer
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
152
Voted
IPCO
1998
15 years 3 months ago
1998
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...