1058 search results - page 20 / 212 » It's Doomed; We Can Prove It |
CIE
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably ...
APN
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. Petri nets are widely used for modeling and analyzing workflows. Using the token-game semantics, Petri net-based workflow models can be analyzed before the model is actua...
JAPLL
2008
13 years 9 months ago
2008
A circle graph is the intersection graph of a set of chords of a circle. If a circle graph is prime for the split (or join) decomposition defined by Cunnigham, it has a unique rep...
DSD
2002
IEEE
14 years 2 months ago
2002
IEEE
In this paper we describe a methodology for the formal verification of a DSP chip using the HOL theorem prover. We used an iterative method to specify both the behavioral and stru...
SODA
2012
ACM
12 years 8 days ago
2012
ACM
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...