Sciweavers

755 search results - page 94 / 151
» Graph Transformation for Topology Modelling
Sort
View
FASE
2009
Springer
14 years 18 days ago
Object Flow Definition for Refined Activity Diagrams
Activity diagrams are a well-known means to model the control flow of system behavior. Their expressiveness can be enhanced by using their object flow notation. In addition, we ref...
Stefan Jurack, Leen Lambers, Katharina Mehner, Gab...
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
14 years 1 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie
FSTTCS
2008
Springer
13 years 9 months ago
Banach-Mazur Games on Graphs
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
Erich Grädel
DATE
2009
IEEE
151views Hardware» more  DATE 2009»
14 years 3 months ago
Combined system synthesis and communication architecture exploration for MPSoCs
In this paper, a novel design space exploration approach is proposed that enables a concurrent optimization of the topology, the process binding, and the communication routing of ...
Martin Lukasiewycz, Martin Streubühr, Michael...
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
14 years 2 months ago
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
Yu Wang 0003, Xiang-Yang Li