• Facets (new session)
• Description
• Metadata
• Settings
  • Rule: ActivityStreamsMapasEquivalentb3sb3sifpdbprdf-labelfacetshttp://dbpedia.org/resource/inference/rules/dbpedia#http://dbpedia.org/resource/inference/rules/opencyc#http://dbpedia.org/resource/inference/rules/umbel#http://dbpedia.org/resource/inference/rules/yago#http://dbpedia.org/schema/property_rules#http://www.ontologyportal.org/inference/rules/SUMO#http://www.ontologyportal.org/inference/rules/WordNet#http://www.w3.org/2002/07/owl#ldpoplwebskos-transurn:det:rdf:labelvirtrdf-labelvirtrdf-urlNone
    
  • Inverse Functional Properties: Disabled (fastest) Apply to subjects only Apply to objects only Apply to both subjects and objects
  • "Same As": Disabled (fastest) Apply to subjects only Apply to objects only Apply to both subjects and objects (recommended) Apply to subjects, objects and predicates (not recommended on big datasets) Apply to predicates only (special use cases only)

About: Burke's theorem     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:WikicatProbabilityTheorems, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)

Type: yago:Abstraction100002137yago:Communication100033020yago:Message106598915yago:Proposition106750804yago:Statement106722453yago:Theorem106752293yago:WikicatProbabilityTheorems New Facet based on Instances of this Class

In queueing theory, a discipline within the mathematical theory of probability, Burke's theorem (sometimes the Burke's output theorem) is a theorem (stated and demonstrated by while working at Bell Telephone Laboratories) asserting that, for the M/M/1 queue, M/M/c queue or M/M/∞ queue in the steady state with arrivals is a Poisson process with rate parameter λ: 1. * The departure process is a Poisson process with rate parameter λ. 2. * At time t the number of customers in the queue is independent of the departure process prior to time t.