Sciweavers

94 search results - page 1 / 19
» On Probabilistic Time versus Alternating Time
Sort
View
RTS
2000
82views more  RTS 2000»
13 years 4 months ago
Priority Scheduling Versus Pre-Run-Time Scheduling
Builders of real-time systems often use priority scheduling in their systems without considering alternatives. This paper examines one alternative, pre-run-time scheduling, and sho...
Jia Xu, David Lorge Parnas
ICC
2007
IEEE
123views Communications» more  ICC 2007»
13 years 11 months ago
FP/FIFO Scheduling: Deterministic Versus Probabilistic QoS Guarantees and P-Schedulability
Abstract—In this paper, we focus on applications with quantitative QoS (Quality of Service) requirements in their end-toend response time. Two types of quantitative QoS garantees...
Leïla Azouz Saïdane, Skander Azzaz, Stev...
COCO
2007
Springer
94views Algorithms» more  COCO 2007»
13 years 8 months ago
On Approximate Majority and Probabilistic Time
We prove new results on the circuit complexity of Approximate Majority, which is the problem of computing Majority of a given bit string whose fraction of 1's is bounded away...
Emanuele Viola
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
13 years 8 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh