Sciweavers

2355 search results - page 242 / 471
» Scheduling in the Z-Polyhedral Model
Sort
View
SPIN
2010
Springer
15 years 5 months ago
Time-Bounded Reachability in Distributed Input/Output Interactive Probabilistic Chains
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...
Georgel Calin, Pepijn Crouzen, Pedro R. D'Argenio,...
IPPS
2010
IEEE
15 years 4 months ago
Handling errors in parallel programs based on happens before relations
Abstract--Intervals are a new model for parallel programming based on an explicit happens before relation. Intervals permit fine-grained but high-level control of the program sched...
Nicholas D. Matsakis, Thomas R. Gross
CCE
2008
15 years 6 months ago
Optimal delivery of chemotherapeutic agents in cancer
In this paper, derivation of the optimal chemotherapy schedule is formulated and solved as a dynamic optimization problem. For this purpose two models representing the tumour grow...
Pinky Dua, Vivek Dua, Efstratios N. Pistikopoulos
ICPADS
1998
IEEE
15 years 11 months ago
The XBW Model for Dependable Real-Time Systems
This paper presents a new conceptual model, the XBWModel. Distributed computing is becoming a cost effective way to implement safety critical control systems. To support the devel...
Vilgot Claesson, Stefan Poledna, Jan Söderber...
EPIA
1999
Springer
15 years 11 months ago
Combinatorial Optimization in OPL Studio
OPL is a modeling language for mathematical programming and combinatorial optimization problems. It is the first modeling language to combine high-level algebraic and set notation...
Pascal Van Hentenryck, Laurent Michel, Philippe La...