Sciweavers

3229 search results - page 352 / 646
» The Theory of Timed Automata
Sort
View
DIALM
2005
ACM
104views Algorithms» more  DIALM 2005»
15 years 8 months ago
Information dissemination in highly dynamic graphs
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
Regina O'Dell, Roger Wattenhofer
ECAI
2008
Springer
15 years 8 months ago
A Simulation-based Approach for Solving Generalized Semi-Markov Decision Processes
Time is a crucial variable in planning and often requires special attention since it introduces a specific structure along with additional complexity, especially in the case of dec...
Emmanuel Rachelson, Gauthier Quesnel, Fréd&...
MASCOTS
2010
15 years 8 months ago
Modeling the Run-time Behavior of Transactional Memory
In this paper, we develop a queuing theory based analytical model to evaluate the performance of transactional memory. Based on the statistical characteristics observed on actual e...
Zhengyu He, Bo Hong
CATS
2006
15 years 8 months ago
A Polynomial Algorithm for Codes Based on Directed Graphs
A complete description and proof of correctness are given for a new polynomial time algorithm for a class of codes based on directed graphs and involving construction well known i...
A. V. Kelarev
ROOM
2000
15 years 8 months ago
An Overview of The Mensurae Language: Specifying Business Processes
We describe a language which can be used to model business processes (both technical and nontechnical). It has a formal semantics, so as to enable formal analysis and prediction o...
T. S. E. Maibaum