Sciweavers

71 search results - page 1 / 15
» The computational complexity of the criticality problems in ...
Sort
View
EOR
2002
68views more  EOR 2002»
13 years 4 months ago
The computational complexity of the criticality problems in a network with interval activity times
The paper analyzes the criticality in a network with interval activities duration times. A natural generalization of the criticality notion (for a path, an activity and an event) ...
Stefan Chanas, Pawel Zielinski
SCHEDULING
2010
137views more  SCHEDULING 2010»
13 years 3 months ago
Criticality analysis of activity networks under interval uncertainty
This paper reconsiders the PERT scheduling problem when information about task duration is incomplete. We model uncertainty on task durations by intervals. With this problem formu...
Jérôme Fortin, Pawel Zielinski, Didie...
TSMC
2002
91views more  TSMC 2002»
13 years 4 months ago
On the sure criticality of tasks in activity networks with imprecise durations
Abstract--The notion of the necessary criticality (both with respect to path and to activity) of a network with imprecisely defined (by means of intervals or fuzzy intervals) activ...
Stefan Chanas, Didier Dubois, Pawel Zielinski
JSS
2011
126views more  JSS 2011»
12 years 7 months ago
A novel statistical time-series pattern based interval forecasting strategy for activity durations in workflow systems
Forecasting workflow activity durations is of great importance to support satisfactory QoS in workflow systems. Traditionally, a workflow system is often designed to facilitate the...
Xiao Liu, Zhiwei Ni, Dong Yuan, Yuan-Chun Jiang, Z...
NCA
2005
IEEE
13 years 10 months ago
Slingshot: Time-Critical Multicast for Clustered Applications
Datacenters are complex environments consisting of thousands of failure-prone commodity components connected by fast, high-capacity interconnects. The software running on such dat...
Mahesh Balakrishnan, Stefan Pleisch, Ken Birman