Sciweavers

1161 search results - page 40 / 233
» Kinetic Dependence Graphs
Sort
View
117
Voted
DSN
2009
IEEE
15 years 3 months ago
Sharing end-user negative symptoms for improving overlay network dependability
The dependability of overlay services rely on the overlay network’s capabilities to effectively diagnose and recover faults (e.g., link failures, overlay node outages). However,...
Yongning Tang, Ehab Al-Shaer
SERP
2008
15 years 1 months ago
Mapping Data-Flow Dependencies onto Distributed Embedded Systems
Model-driven development (MDD) is an emerging paradigm and has become state-of-the-art for embedded systems software design. In the overall design process, several steps have to be...
Stefan Kugele, Wolfgang Haberl
91
Voted
ATVA
2009
Springer
125views Hardware» more  ATVA 2009»
15 years 7 months ago
Automated Analysis of Data-Dependent Programs with Dynamic Memory
We present a new approach for automatic verification of data-dependent programs manipulating dynamic heaps. A heap is encoded by a graph where the nodes represent the cells, and t...
Parosh Aziz Abdulla, Muhsin Atto, Jonathan Cederbe...
BIRTHDAY
2005
Springer
15 years 6 months ago
Simulating Algebraic High-Level Nets by Parallel Attributed Graph Transformation
The “classical” approach to represent Petri nets by graph transformation systems is to translate each transition of a specific Petri net to a graph rule (behavior rule). This ...
Claudia Ermel, Gabriele Taentzer, Roswitha Bardohl
93
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
Prize-Collecting Data Fusion for Cost-Performance Tradeoff in Distributed Inference
—A novel formulation for optimal sensor selection and in-network fusion for distributed inference known as the prizecollecting data fusion (PCDF) is proposed in terms of optimal ...
Animashree Anandkumar, Meng Wang, Lang Tong, Anant...