Inferring most likely queue length from transactional data (Q1360114): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0167-6377(96)00027-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2039985813 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Vehicle Routing Problem with Stochastic Demand / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting Markov chains to infer queue length from transactional data / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-point Markov chain boundary-value problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Queue Inference Engine: Deducing Queue Statistics from Transactional Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank

Latest revision as of 16:23, 27 May 2024

scientific article
Language Label Description Also known as
English
Inferring most likely queue length from transactional data
scientific article

    Statements

    Inferring most likely queue length from transactional data (English)
    0 references
    30 October 1997
    0 references
    length of an M/G/1 queue
    0 references
    transactional data
    0 references
    queue-inferencing algorithms
    0 references

    Identifiers