Analýsa elektrických obvodů v ustáleném stavu pomocí samočinného číslicového počítače
Efficient covering designs of the complete graph.
On Golomb birulers and their applications
Packing graphs: The packing problem solved.
Semi-Markov-based approach for the analysis of open tandem networks with blocking and truncation
This paper describes an analytical study of open two-node (tandem) network models with blocking and truncation. The study is based on semi-Markov process theory, and network models assume that multiple servers serve each queue. Tasks arrive at the tandem in a Poisson fashion at the rate λ, and the service times at the first and the second node are nonexponentially distributed with means sA and sB , respectively. Both nodes have buffers with finite capacities. In this type of network, if the second...
Single-sweep timing simulation
The theory of networks of single server queues and the tandem queue model.