Sciweavers

14 search results - page 2 / 3
» Boxed Ambients
Sort
View
FM
2003
Springer
146views Formal Methods» more  FM 2003»
13 years 9 months ago
Interacting State Machines for Mobility
We present two instantiations of generic Interactive State Machines (ISMs) with mobility features which are useful for modeling and verifying dynamically changing mobile systems. I...
Thomas A. Kuhn, David von Oheimb
IFIP
2004
Springer
13 years 9 months ago
PolyA: True Type Polymorphism for Mobile Ambients
Previous type systems for mobility calculi (the original Mobile Ambients, its variants and descendants, e.g., Boxed Ambients and Safe Ambients, and other related systems) offer lit...
Torben Amtoft, Henning Makholm, J. B. Wells
ICALP
2004
Springer
13 years 9 months ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee
DC
2010
13 years 1 months ago
A taxonomy of process calculi for distribution and mobility
In this paper, we comparatively analyze some mainstream calculi for mobility and distribution, together with some of their variants: asynchronous -calculus, distributed -calculus,...
Daniele Gorla
EWSA
2005
Springer
13 years 10 months ago
Towards Context-Sensitive Intelligence
Even modern component architectures do not provide for easily manageable context-sensitive adaptability, a key requirement for ambient intelligence. The reason is that components a...
Holger Mügge, Tobias Rho, Marcel Winandy, Mar...