Sciweavers

2125 search results - page 212 / 425
» On Graph Complexity
Sort
View
ALGOSENSORS
2009
Springer
15 years 9 months ago
Link Reversal: How to Play Better to Work Less
Sensor networks, with their ad hoc deployments, node mobility, and wireless communication, pose serious challenges for developing provably correct and efficient applications. A po...
Bernadette Charron-Bost, Jennifer L. Welch, Josef ...
TOOLS
2010
IEEE
15 years 8 months ago
Read-Only Execution for Dynamic Languages
Supporting read-only and side effect free execution has been the focus of a large body of work in the area of statically typed programming languages. Read-onlyness in dynamically t...
Jean-Baptiste Arnaud, Marcus Denker, Stépha...
DAC
2005
ACM
16 years 4 months ago
Simulation based deadlock analysis for system level designs
In the design of highly complex, heterogeneous, and concurrent systems, deadlock detection and resolution remains an important issue. In this paper, we systematically analyze the ...
Xi Chen, Abhijit Davare, Harry Hsieh, Alberto L. S...
ECRTS
2008
IEEE
15 years 9 months ago
Temporal Analysis for Adapting Concurrent Applications to Embedded Systems
Embedded services and applications that interact with the real world often, over time, need to run on different kinds of hardware (low-cost microcontrollers to powerful multicore ...
Sibin Mohan, Johannes Helander
121
Voted
CORR
2010
Springer
112views Education» more  CORR 2010»
15 years 3 months ago
On Finding Frequent Patterns in Event Sequences
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some...
Andrea Campagna, Rasmus Pagh