181 search results - page 12 / 37 » On Quantification with A Finite Universe |
CSFW
2010
IEEE
13 years 11 months ago
2010
IEEE
We consider the problem of automating open bisimulation checking for the spi-calculus, an extension of the pi-calculus with cryptographic primitives. The notion of open bisimulatio...
PODS
2010
ACM
13 years 9 months ago
2010
ACM
Schema mappings are high-level specifications that describe the relationship between two database schemas; they are considered to be the essential building blocks in data exchange...
TOCL
2002
13 years 7 months ago
2002
Computability and Algebraic Specification J. V. TUCKER University of Wales, Swansea and J. I. ZUCKER McMaster University Abstract computable functions are defined by abstract finit...
IPL
2006
13 years 7 months ago
2006
The strongest well-known measure for the quality of a universal hash-function family H is its being -strongly universal, which measures, for randomly chosen h H, one's inabi...
ICRA
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— This paper proposes a multiple robot control algorithm to approach the problem of patrolling an open or closed line. The algorithm is fully decentralized, i.e., no comm...