Sciweavers

2294 search results - page 188 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
DAGSTUHL
2006
14 years 11 months ago
Enriched categories and models for spaces of dipaths
Partially ordered sets, causets, partially ordered spaces and their local counterparts are now often used to model systems in computer science and theoretical physics. The order mo...
Timothy Porter
EMSOFT
2006
Springer
15 years 1 months ago
Scheduling for multi-threaded real-time programs via path planning
The paper deals with the problem of computing schedules for multi-threaded real-time programs. In [14] we introduced a scheduling method based on the geometrization of PV programs...
Thao Dang, Philippe Gerner
SODA
2012
ACM
253views Algorithms» more  SODA 2012»
13 years 17 days ago
Kernelization of packing problems
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
Holger Dell, Dániel Marx
VLDB
2001
ACM
104views Database» more  VLDB 2001»
15 years 10 months ago
Global transaction support for workflow management systems: from formal specification to practical implementation
In this paper, we present an approach to global transactionmanagementinworkflowenvironments.Thetransaction mechanism is based on the well-known notion of compensation, but extended...
Paul W. P. J. Grefen, Jochem Vonk, Peter M. G. Ape...
MOBISYS
2006
ACM
15 years 9 months ago
Building realistic mobility models from coarse-grained traces
In this paper we present a trace-driven framework capable of building realistic mobility models for the simulation studies of mobile systems. With the goal of realism, this framew...
Jungkeun Yoon, Brian D. Noble, Mingyan Liu, Minkyo...