Sciweavers

6598 search results - page 146 / 1320
» Graph Theory with Applications
Sort
View
DEBS
2007
ACM
15 years 8 months ago
Towards a theory of events
Event-driven systems are used in a wide range of applications such as responding to missile attacks, interdicting potential terrorists, exploiting arbitrage opportunities and resp...
K. Mani Chandy, Michel Charpentier, Agostino Cappo...
DICS
2006
15 years 8 months ago
Fault-Tolerant Parallel Applications with Dynamic Parallel Schedules: A Programmer's Perspective
Dynamic Parallel Schedules (DPS) is a flow graph based framework for developing parallel applications on clusters of workstations. The DPS flow graph execution model enables automa...
Sebastian Gerlach, Basile Schaeli, Roger D. Hersch
DSN
2011
IEEE
14 years 4 months ago
Modeling stream processing applications for dependability evaluation
— This paper describes a modeling framework for evaluating the impact of faults on the output of streaming ions. Our model is based on three abstractions: stream operators, strea...
Gabriela Jacques-Silva, Zbigniew Kalbarczyk, Bugra...
COMPGEOM
2006
ACM
15 years 10 months ago
Minimum weight triangulation is NP-hard
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
Wolfgang Mulzer, Günter Rote
COMPGEOM
2007
ACM
15 years 8 months ago
Embedding 3-polytopes on a small grid
We show how to embed a 3-connected planar graph with n vertices as a 3-polytope with small integer coordinates. The coordinates are bounded by O(27.55n ). The crucial part is the ...
Ares Ribó Mor, Günter Rote, Andr&eacut...