Sciweavers

906 search results - page 97 / 182
» Linking Theories of Concurrency
Sort
View
VISSYM
2007
15 years 7 days ago
Path Visualization for Adjacency Matrices
For displaying a dense graph, an adjacency matrix is superior than a node-link diagram because it is more compact and free of visual clutter. A node-link diagram, however, is far ...
Zeqian Shen, Kwan-Liu Ma
CONEXT
2005
ACM
14 years 11 months ago
The stability of paths in a dynamic network
Dynamic networks appear in several contexts: QoS routing faces the difficult problem of accurately and efficiently maintaining, distributing and updating network state information...
Fernando A. Kuipers, Huijuan Wang, Piet Van Mieghe...
CONEXT
2008
ACM
14 years 11 months ago
DaVinci: dynamically adaptive virtual networks for a customized internet
Running multiple virtual networks, customized for different performance objectives, is a promising way to support diverse applications over a shared substrate. Despite being simpl...
Jiayue He, Rui Zhang-Shen, Ying Li, Cheng-Yen Lee,...
IMC
2007
ACM
14 years 11 months ago
A data streaming algorithm for estimating entropies of od flows
Entropy has recently gained considerable significance as an important metric for network measurement. Previous research has shown its utility in clustering traffic and detecting ...
Haiquan (Chuck) Zhao, Ashwin Lall, Mitsunori Ogiha...
CONCUR
2010
Springer
14 years 11 months ago
Learning I/O Automata
Links are established between three widely used modeling frameworks for reactive systems: the ioco theory of Tretmans, the interface automata of De Alfaro and Henzinger, and Mealy ...
Fides Aarts, Frits W. Vaandrager