Ross's conjecture
http://dbpedia.org/resource/Ross's_conjecture an entity of type: Abstraction100002137
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.
rdf:langString
罗斯猜想是排队理论的猜想，若一個排队队伍中，顾客不是随机到达的最简单模型來排队，此猜想提供顾客平均等待时间下界。这是美国南加州大学教授谢尔顿·M·罗斯在1978年提出的猜想，1981年由波兰的Tomasz Rolski教授证明。用罗斯猜想可得到其下界，而在有限的缓冲队列下，下界不成立。
rdf:langString
rdf:langString
Ross's conjecture
rdf:langString
罗斯猜想
xsd:integer
37881898
xsd:integer
1031297030
rdf:langString
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.
rdf:langString
罗斯猜想是排队理论的猜想，若一個排队队伍中，顾客不是随机到达的最简单模型來排队，此猜想提供顾客平均等待时间下界。这是美国南加州大学教授谢尔顿·M·罗斯在1978年提出的猜想，1981年由波兰的Tomasz Rolski教授证明。用罗斯猜想可得到其下界，而在有限的缓冲队列下，下界不成立。
xsd:nonNegativeInteger
2282