Sciweavers

458 search results - page 54 / 92
» Designing and executing protocols using the event calculus
Sort
View
EJWCN
2011
77views more  EJWCN 2011»
13 years 3 months ago
Emulating Opportunistic Networks with KauNet Triggers
In opportunistic networks the availability of an end-to-end path is no longer required. Instead opportunistic networks may take advantage of temporary connectivity opportunities. ...
Tanguy Pérennou, Anna Brunstrom, Tomas Hall...
ICNP
2007
IEEE
14 years 3 months ago
Inferring the Origin of Routing Changes using Link Weights
— The global Internet routing infrastructure is a large and complex distributed system where routing changes occur constantly. Our objective in this paper is to develop a simple ...
Mohit Lad, Ricardo V. Oliveira, Daniel Massey, Lix...
OOPSLA
2005
Springer
14 years 2 months ago
Adding trace matching with free variables to AspectJ
An aspect observes the execution of a base program; when certain actions occur, the aspect runs some extra code of its own. In the AspectJ language, the observations that an aspec...
Chris Allan, Pavel Avgustinov, Aske Simon Christen...
AAAI
2008
13 years 10 months ago
Reasoning about Large Taxonomies of Actions
We design a representation based on the situation calculus to facilitate development, maintenance and elaboration of very large taxonomies of actions. This representation leads to...
Yilan Gu, Mikhail Soutchanski
ENTCS
2002
97views more  ENTCS 2002»
13 years 8 months ago
Plan in Maude: Specifying an Active Network Programming Language
PLAN is a language designed for programming active networks, and can more generally be regarded as a model of mobile computation. PLAN generalizes the paradigm of imperative funct...
Mark-Oliver Stehr, Carolyn L. Talcott