Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

EOR
2002

favoriteEmaildiscussreport

68views more EOR 2002»

The computational complexity of the criticality problems in a network with interval activity times

13 years 4 months ago

The computational complexity of the criticality problems in a network with interval activity times

Download www.im.pwr.wroc.pl

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) for the case of network with interval activity duration times is given. The computation complexity of

Stefan Chanas, Pawel Zielinski

Real-time Traffic

Criticality Notion | Duration Times | EOR 2002 | Interval Activities Duration |

claim paper

Related Content

» Criticality analysis of activity networks under interval uncertainty

» On the sure criticality of tasks in activity networks with imprecise durations

» A novel statistical timeseries pattern based interval forecasting strategy for activity du...

» Slingshot TimeCritical Multicast for Clustered Applications

» Threats and TradeOffs in Resource Critical Crowdsourcing Tasks Over Networks

» Role of the Cerebellum in TimeCritical GoalOriented Behaviour Anatomical Basis and Control...

» Code Placement with Selective Cache Activity Minimization for Embedded Realtime Software D...

» Revisiting the Semantics of Interval Probabilistic Logic Programs

» Range Efficient Computation of F0 over Massive Data Streams

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2002
Where	EOR
Authors	Stefan Chanas, Pawel Zielinski

Comments (0)