Sciweavers

7274 search results - page 1423 / 1455
» Abstractions for network update
Sort
View
IMC
2005
ACM
14 years 1 months ago
Poisson versus Periodic Path Probing (or, Does PASTA Matter?)
Abstract— The well-known PASTA (“Poisson Arrivals See Time Averages”) property states that, under very general conditions, the fraction of Poisson arrivals that observe an un...
Muhammad Mukarram Bin Tariq, Amogh Dhamdhere, Cons...
WOSP
2005
ACM
14 years 1 months ago
From UML to LQN by XML algebra-based model transformations
The change of focus from code to models promoted by OMG's Model Driven Development raises the need for verification of nonfunctional characteristics of UML models, such as pe...
Gordon Ping Gu, Dorina C. Petriu
BIRTHDAY
2005
Springer
14 years 1 months ago
Planning in Answer Set Programming using Ordered Task Decomposition
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...
Jürgen Dix, Ugur Kuter, Dana S. Nau
BTW
2005
Springer
142views Database» more  BTW 2005»
14 years 1 months ago
Self-Extending Peer Data Management
Abstract: Peer data management systems (PDMS) are the natural extension of integrated information systems. Conventionally, a single integrating system manages an integrated schema,...
Ralf Heese, Sven Herschel, Felix Naumann, Armin Ro...
CRYPTO
2005
Springer
113views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
Secure Communications over Insecure Channels Based on Short Authenticated Strings
Abstract. We propose a way to establish peer-to-peer authenticated communications over an insecure channel by using an extra channel which can authenticate very short strings, e.g....
Serge Vaudenay
« Prev « First page 1423 / 1455 Last » Next »