71 search results - page 7 / 15 » Partial Order Reduction for Probabilistic Branching Time |
194
click to vote
CDC
2010
IEEE
14 years 9 months ago
2010
IEEE
— The problem of placing an arbitrary subset (m) of the (n) closed loop eigenvalues of a nth order continuous time single input linear time invariant(LTI) system, using full stat...
142
click to vote
ICS
1998
Tsinghua U.
15 years 10 months ago
1998
Tsinghua U.
In order to achieve high performance, contemporary microprocessors must effectively process the four major instruction types: ALU, branch, load, and store instructions. This paper...
160
click to vote
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
Exact substring matching queries on large data collections can be answered using q-gram indices, that store for each occurring q-byte pattern an (ordered) posting list with the po...
146
click to vote
SOSP
2009
ACM
16 years 2 months ago
2009
ACM
Bug reproduction is critically important for diagnosing a production-run failure. Unfortunately, reproducing a concurrency bug on multi-processors (e.g., multi-core) is challengin...
170
click to vote
ICDE
2010
IEEE
16 years 5 months ago
2010
IEEE
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...