Sciweavers

19 search results - page 4 / 4
» A Polynomial All Outcome Determinization for Probabilistic P...
Sort
View
CORR
2008
Springer
139views Education» more  CORR 2008»
13 years 5 months ago
Exact two-terminal reliability of some directed networks
Abstract-- The calculation of network reliability in a probabilistic context has long been an issue of practical and academic importance. Conventional approaches (determination of ...
Christian Tanguy
STOC
2002
ACM
111views Algorithms» more  STOC 2002»
14 years 5 months ago
The price of anarchy is independent of the network topology
We study the degradation in network performance caused by the selfish behavior of noncooperative network users. We consider a model of selfish routing in which the latency experie...
Tim Roughgarden
JAIR
2008
148views more  JAIR 2008»
13 years 5 months ago
Learning Partially Observable Deterministic Action Models
We present exact algorithms for identifying deterministic-actions' effects and preconditions in dynamic partially observable domains. They apply when one does not know the ac...
Eyal Amir, Allen Chang
RTSS
1992
IEEE
13 years 9 months ago
Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...
Chao-Ju Hou, Kang G. Shin