70 search results - page 2 / 14 » On the queue-overflow probabilities of distributed schedulin... |
SBMF
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. In the verification of concurrent systems involving probabilities, the aim is to find out the maximum/minimum probability that a given event occurs (examples of such ev...
JPDC
2007
13 years 4 months ago
2007
High quality of security is increasingly critical for applications running on heterogeneous distributed systems. However, existing scheduling algorithms for heterogeneous distribu...
FORMATS
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
CORR
2011
Springer
12 years 8 months ago
2011
Springer
Opportunistic scheduling and routing can in principle greatly increase the throughput of decentralized wireless networks, but to be practical such algorithms must do so with small...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
Real Options for Project Schedules (ROPS) has three recursive sampling/optimization shells. An outer Adaptive Simulated Annealing (ASA) optimization shell optimizes parameters of ...