Viscolani, Bruno A queueing problem in pattern recognition. (English) Zbl 0575.68089 RAIRO, Rech. Opér. 18, 71-88 (1984). Patterns arrive at random instants to a sequential recognizer and possibly form a queue. Each pattern is recognized through one or more consecutive stages following a definite discipline; the times spent by a pattern in the different stages are assumed to be independent random variables. The resulting model of the recognizer is a Markov queueing system with a service discipline which aims to minimize both the queue- size and the error probability. The traffic intensity of the patterns and the probabilities of entry in the different stages are the parameters which determine the equilibrium probabilities of the system. From these, then, the error probability and other characteristics of interest follow. Afterwards the hypothesis of service-time independency is removed and other special cases are also considered. Cited in 1 Document MSC: 68T10 Pattern recognition, speech recognition 90B22 Queues and service in operations research Keywords:sequential recognizer; Markov queueing system; traffic intensity; equilibrium probabilities; error probability; service-time independency PDFBibTeX XMLCite \textit{B. Viscolani}, RAIRO, Rech. Opér. 18, 71--88 (1984; Zbl 0575.68089) Full Text: DOI EuDML