554 search results - page 57 / 111 » Approximate Probabilistic Model Checking |
RSCTC
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
TCS
2002
13 years 7 months ago
2002
We consider the timed automata model of [3], which allows the analysis of realtime systems expressed in terms of quantitative timing constraints. Traditional approaches to real-ti...
CSCLP
2008
Springer
13 years 9 months ago
2008
Springer
In the analysis of hybrid discrete-continuous systems, rich arithmetic constraint formulae with complex Boolean structure arise naturally. The iSAT algorithm, a solver for such for...
AMC
2006
13 years 7 months ago
2006
Dynamic models of elastic structures are derived using approximations of linear three dimensional elasticity. A model for the three dimensional motion of a nonsymmetric structure ...