Showing 1 - 10 of 97
A ranking method assigns to every weighted directed graph a (weak) orderingof the nodes. In this paper we axiomatize the ranking method that ranksthe nodes according to their outflow using four independent axioms. This outflowranking method generalizes the ranking by outdegree for directed...
Persistent link: https://www.econbiz.de/10011255526
A ranking method assigns to every weighted directed graph a (weak) ordering
Persistent link: https://www.econbiz.de/10005144488
We develop a methodology for studying "large deviations type" questions. Our approach does not require that the large deviations principle holds, and is thus applicable to a larg class of systems. We study a system of queues with exponential servers, which share an arrival stream. Arrivals are...
Persistent link: https://www.econbiz.de/10005144565
We develop a methodology for studying ''large deviations type'' questions. Our approach does not require that the large deviations principle holds, and is thus applicable to a larg class of systems. We study a system of queues with exponential servers, which share an arrival stream. Arrivals are...
Persistent link: https://www.econbiz.de/10005136883
In this paper, we consider deterministic (both fluid and discrete) polling systems with <I>N</I> queues with infinite buffers and we show how to compute the best polling sequence (minimizing the average total workload). With two queues, the best polling sequence is always periodic when the system is...</i>
Persistent link: https://www.econbiz.de/10005137254
A sequence of real numbers (<I>x<sub>n</sub></I>) is Benford if the significands, i.e. the fraction
Persistent link: https://www.econbiz.de/10008838552
We develop a methodology for studying ''large deviations type'' questions. Our approach does not require that the large deviations principle holds, and is thus applicable to a larg class of systems. We study a system of queues with exponential servers, which share an arrival stream. Arrivals are...
Persistent link: https://www.econbiz.de/10011256550
In this paper, we consider deterministic (both fluid and discrete) polling systems with N queues with infinite buffers and we show how to compute the best polling sequence (minimizing the average total workload). With two queues, the best polling sequence is always periodic when the system is...
Persistent link: https://www.econbiz.de/10011257131
This discussion paper resulted in a publication in the <I>Siam Journal on Matrix Analysis and Applications (2011). Volume 32, issue 3, pages 665-684.<P> A sequence of real numbers (<I>x<sub>n</sub></I>) is Benford if the significands, i.e. the fractionparts in the floating-point representation of (<I>x<sub>n</sub></I>), are distributed...</i></i></p></i>
Persistent link: https://www.econbiz.de/10011257212
This discussion paper resulted in a publication in the <I>Mathematical Methods of Operations Research</I> (2005). Volume 62, issue 3, pages 467-483.<P> We develop a methodology for studying "large deviations type" questions. Our approach does not require that the large deviations principle holds, and is...</p></i>
Persistent link: https://www.econbiz.de/10011257602