1677 search results - page 73 / 336 » On the Completeness of Quantum Computation Models |
130
click to vote
MIDDLEWARE
2004
Springer
15 years 6 months ago
2004
Springer
This paper surveys a variety of subsystems designed to be the building blocks from which sophisticated infrastructures for ubiquitous computing are assembled. Our experience shows...
78
Voted
LICS
2006
IEEE
15 years 7 months ago
2006
IEEE
We give a semantic characterization of bounded complexity proofs. We introduce the notion of obsessional clique in the relational model of linear logic and show that restricting t...
113
click to vote
FOSSACS
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. Among the branching-time temporal logics used for the specification and verification of systems, CTL+ , FCTL and ECTL+ are the most notable logics for which the precise...
WIOPT
2006
IEEE
15 years 7 months ago
2006
IEEE
— We introduce and discuss a novel link model that incorporates both uncertainty in the fading coefficients and the node distances for ad hoc networks with randomly placed nodes...
ASPDAC
2006
ACM
15 years 7 months ago
2006
ACM
— Lack of complete formal specification is one of the major obstacles for the deployment of model checking. Coverage estimation addresses this issue by revealing the unverified...