Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Ross's_conjecture> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- Ross's_conjecture abstract "In queueing theory, a discipline within the mathematical theory of probability, Ross's conjecture gives a lower bound for the average waiting-time experienced by a customer when arrivals to the queue do not follow the simplest model for random arrivals. It was proposed by Sheldon M. Ross in 1978 and proved in 1981 by Tomasz Rolski. Equality can be obtained in the bound; and the bound does not hold for finite buffer queues.".
- Ross's_conjecture wikiPageID "37881898".
- Ross's_conjecture wikiPageRevisionID "561793243".
- Ross's_conjecture subject Category:Probabilistic_inequalities.
- Ross's_conjecture subject Category:Queueing_theory.
- Ross's_conjecture comment "In queueing theory, a discipline within the mathematical theory of probability, Ross's conjecture gives a lower bound for the average waiting-time experienced by a customer when arrivals to the queue do not follow the simplest model for random arrivals. It was proposed by Sheldon M. Ross in 1978 and proved in 1981 by Tomasz Rolski. Equality can be obtained in the bound; and the bound does not hold for finite buffer queues.".
- Ross's_conjecture label "Ross's conjecture".
- Ross's_conjecture sameAs m.0p3k88d.
- Ross's_conjecture sameAs Q7369136.
- Ross's_conjecture sameAs Q7369136.
- Ross's_conjecture wasDerivedFrom Ross's_conjecture?oldid=561793243.
- Ross's_conjecture isPrimaryTopicOf Ross's_conjecture.