575 search results - page 82 / 115 » Model Checking Restricted Sets of Timed Paths |
126
click to vote
BCB
2010
14 years 7 months ago
2010
Growing sequencing and assembly efforts have been met by the advances in high throughput machines. However, the presence of massive amounts of repeats and transposons complicates ...
ER
2008
Springer
15 years 1 months ago
2008
Springer
The capability to dynamically evolve process models over time and to migrate process instances to a modified model version are fundamental requirements for any process-aware inform...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some...
118
click to vote
SIAMCOMP
2012
13 years 2 months ago
2012
Let S be a set of n intervals in R, and let (S, +) be any commutative semigroup. We assign a weight ω(s) ∈ S to each interval in S. For a point x ∈ R, let S(x) ⊆ S be the se...
107
click to vote
STOC
2006
ACM
16 years 6 days ago
2006
ACM
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...