3954 search results - page 336 / 791 » Image-based Model Completion |
194
click to vote
LICS
1998
IEEE
15 years 10 months ago
1998
IEEE
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
196
click to vote
POPL
1991
ACM
15 years 9 months ago
1991
ACM
We investigate the interactions of subtyping and recursive types, in a simply typed λ-calculus. The two fundamental questions here are whether two (recursive) types are in the su...
177
click to vote
AAAI
2008
15 years 8 months ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
158
click to vote
SIROCCO
2008
15 years 7 months ago
2008
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...
146
click to vote
ECIS
2001
15 years 7 months ago
2001
It has been almost three decades since Nolan proposed his stages hypothesis. Since then several studies on the stages of growth theory appeared in the academic literature. Despite...