1967 search results - page 295 / 394 » The Case for Determinism in Database Systems |
170
click to vote
CAV
2001
Springer
15 years 10 months ago
2001
Springer
Model Checking is an algorithmic technique to determine whether a temporal property holds of a program. For linear time properties, a model checker produces a counterexample comput...
153
click to vote
ICC
2000
IEEE
15 years 10 months ago
2000
IEEE
— In this paper, we present a framework for the analysis of a set of adaptive variable-bit-rate voice sources in a packet network. The instantaneous bit rate of each source is de...
171
click to vote
FM
2006
Springer
15 years 10 months ago
2006
Springer
Symmetry reduction techniques can help to combat the state space explosion problem for model checking, but are restricted by the hard problem of determining equivalence of states d...
179
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
This work presents a best-first anytime algorithm for computing optimal coalition structures. The approach is novel in that it generates coalition structures based on coalition va...
148
click to vote
COMAD
2008
15 years 7 months ago
2008
In designing and developing large complex products, people use models to describe and organize interrelated elements in both product systems (architecture, use cases, constraints....