Analysis of Henriksen's Algorithm for the Simulation Event Set
暂无分享,去创建一个
An algorithm for the scheduling of events in a discrete-event simulation system, due to J. O. Henriksen, is presented. An $O(n^{{1 / 2}} )$ upper bound on the average cost of an insertion during st...
[1] Kurt Maly,et al. An efficient data structure for the simulation event set , 1977, CACM.
[2] Gaston H. Gonnet,et al. Heaps applied to event driven mechanisms , 1976, CACM.