2024 search results - page 254 / 405 » A Formal Model of Multi-agent Computations |
JMLR
2010
14 years 6 months ago
2010
Composite likelihood methods provide a wide spectrum of computationally efficient techniques for statistical tasks such as parameter estimation and model selection. In this paper,...
FM
2006
Springer
15 years 3 months ago
2006
Springer
We summarize some current trends in embedded systems design and point out some of their characteristics, such as the chasm between analytical and computational models, and the gap ...
117
click to vote
CONCUR
1992
Springer
15 years 3 months ago
1992
Springer
The states of a computing system bear information and change time, while its events bear time and change information. We develop a primitive algebraic model of this duality of tim...
CIE
2010
Springer
15 years 3 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
126
click to vote
TACAS
2012
Springer
13 years 7 months ago
2012
Springer
FShell is an automated white-box test-input generator for C programs, computing test data with respect to user-specified code coverage criteria. The pillars of FShell are the decl...