Version 1
: Received: 6 September 2024 / Approved: 7 September 2024 / Online: 9 September 2024 (09:03:42 CEST)
How to cite:
Kagan, E.; Novoselsky, A. Definition of Optimal Time Intervals in the Queues’ Analysis: The Use of Epsilon-Entropy and Epsilon-Capacity. Preprints2024, 2024090583. https://doi.org/10.20944/preprints202409.0583.v1
Kagan, E.; Novoselsky, A. Definition of Optimal Time Intervals in the Queues’ Analysis: The Use of Epsilon-Entropy and Epsilon-Capacity. Preprints 2024, 2024090583. https://doi.org/10.20944/preprints202409.0583.v1
Kagan, E.; Novoselsky, A. Definition of Optimal Time Intervals in the Queues’ Analysis: The Use of Epsilon-Entropy and Epsilon-Capacity. Preprints2024, 2024090583. https://doi.org/10.20944/preprints202409.0583.v1
APA Style
Kagan, E., & Novoselsky, A. (2024). Definition of Optimal Time Intervals in the Queues’ Analysis: The Use of Epsilon-Entropy and Epsilon-Capacity. Preprints. https://doi.org/10.20944/preprints202409.0583.v1
Chicago/Turabian Style
Kagan, E. and Alexander Novoselsky. 2024 "Definition of Optimal Time Intervals in the Queues’ Analysis: The Use of Epsilon-Entropy and Epsilon-Capacity" Preprints. https://doi.org/10.20944/preprints202409.0583.v1
Abstract
In the paper, we suggest a method for calculating optimal time intervals in the queue analysis. The suggested method processes partitioning of the time interval and utilizes the epsilon-entropy and epsilon-capacity of the partition for finding an optimal partition. Optimality of the partition is specified based on its epsilon-information. The suggested method is illustrated by defining the intervals for histograms of differently distributed samples and demonstrated its effectiveness in comparison with the existing methods
Computer Science and Mathematics, Applied Mathematics
Copyright:
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.