Sciweavers

925 search results - page 132 / 185
» Connectivity on Complete Lattices
Sort
View
SIGCOMM
2004
ACM
15 years 5 months ago
Routing in a delay tolerant network
We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be kn...
Sushant Jain, Kevin R. Fall, Rabin K. Patra
WOSP
2004
ACM
15 years 5 months ago
Early-stage performance modeling and its application for integrated embedded control software design
Most of current embedded control software (ECSW) development techniques deal only with performance specifications during the early software design phase and delay the modeling and...
Shige Wang, Kang G. Shin
DALT
2004
Springer
15 years 5 months ago
The Logic of Communication Graphs
In 1992, Moss and Parikh studied a bimodal logic of knowledge and effort called Topologic. In this current paper, Topologic is extended to the case of many agents who are assumed...
Eric Pacuit, Rohit Parikh
ER
2004
Springer
79views Database» more  ER 2004»
15 years 5 months ago
Multi-phase Process Mining: Building Instance Graphs
Abstract. Deploying process-driven information systems is a time-consuming and error-prone task. Process mining attempts to improve this by automatically generating a process model...
Boudewijn F. van Dongen, Wil M. P. van der Aalst
ISSAC
2004
Springer
185views Mathematics» more  ISSAC 2004»
15 years 5 months ago
Automatic generation of polynomial loop
In [17], an abstract framework for automatically generating loop invariants of imperative programs was proposed. This framework was then instantiated for the language of conjuncti...
Enric Rodríguez-Carbonell, Deepak Kapur