A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 1997; you can also visit the original URL.
The file type is
BRICS Report Series
These bounds are asymptotically optimal among all comparison-based priority queues. In this paper, we adapt<br />Brodal's data structure to a purely functional setting. ... the running time of findMin to O(1) by adding a global root to hold the minimum element; and finally, we reduce the running time of meld to O(1) by allowing priority queues to contain other<br />priority ... In this paper, we consider the design of an efficient purely functional priority queue. ...doi:10.7146/brics.v3i37.20019 fatcat:ebvsdo4zxngnhbhooruumouffe
These bounds are asymptotically optimal among all comparison-based priority queues. In this paper, we adapt Brodal's data structure to a purely functional setting. ... running time offindMintoO(1) by adding a global root to hold the minimum element; and finally, we reduce the running time ofmeldtoO(1) by allowing priority queues to contain other priority queues. ... In this paper, we consider the design of an efficient purely functional priority queue. ...doi:10.1017/s095679680000201x fatcat:bcluocodrrcmhn6j255l7egave
We provide a detailed analysis of a queueing model in which two priority levels can be purchased. ... In particular, we compute all of the Nash equilibrium strategies (pure and mixed) of the threshold type. ... Also, the example can be extended to equilibria where for some integer k the strategy is to join the low priority queue in states (0; i) i = 0; :::; k ? 2, buy priority at (0; k ? ...doi:10.1287/opre.45.6.966 fatcat:z6rpxqfq3veqfn4o6rjmgkbcdu
The new queue discipline, named accumulative priority queue with finite horizon and denoted by APQ-h, is an extension of the accumulative priority queue (APQ) discipline that considers not only the acuity ... An extensive computational analysis shows the flexibility of the APQ-h and APQ discipline and their superiority over other pure priority disciplines in a real setting and in a variety of ED scenarios. ... Pure priority rules The simplest queue disciplines are those based on pure priority rules. ...doi:10.1016/j.orhc.2019.100224 fatcat:s5i4deawlfe77atjig6apjk264
Finally, we formulate the revenue function of the service provider and present the Particle Swarm Optimization algorithm to seek the optimal service prices for the high-priority and low-priority customers ... In this present paper, we study a special batch service polling system (the so-called Israeli queue) with priorities. ... e Individual Optimal Pure Strategy of High-Priority Customers. Next, based on the above results, we first determine the unique individual optimal pure strategy of highpriority customers. ...doi:10.1155/2020/6015372 fatcat:fd2qzujcubfupgdrghcsmtep2y
metric, and aims to imitate such optimal behavior when applied to new situations. ... The APQ method linearly assigns priority scores to patients with respect to their time in the system and acuity level. ... A majority of proposed models select patients by a purely priority-based policy. ...arXiv:2206.03752v1 fatcat:pvm4vylns5g3nc3vdpx3sobjku
ACM SIGCSE Bulletin
The linear assignment problem requires the determination of an optimal permutation vector for the assignment of tasks to agents. ... Even the backtracking implementation supports a rather powerful bounding function. An earlier article discussed the fundamental problem and executing the backtracking in parallel. ... If that list is maintained as a priority queue, one expands the states in a "best fit first" fashion, which rapidly finds an optimal or near-optimal solution, which is then the basis for massive pruning ...doi:10.1145/1709424.1709451 fatcat:s6hujkrd2ve7negcrq3uwbmgpm
The author considers the M we 1|co queueing system. The prob- lem of optimal assignment of priorities is investigated. The objective function is to minimize total costs of penalties. ... B. 6922 Optimal assignment of priorities in queueing systems in the case of nonlinear criteria and in the presence of constraints. (Russian) Avtomat. Sistemy Upravien,. ...
This paper presents a new method for deriving the waiting time distribution of the lowest class in an accumulating priority (AP) queue with positive L\'evy input. ... The priority of a non-atomic customer (particle) is a function of their class and waiting time in the system, and the particles with the highest AP are the next to be processed. ... in an accumulating priority queue. ...doi:10.1007/s10479-016-2141-4 fatcat:4x5frr4tynccpfp4c7peyqgoym
Consider an unobservable M|G|1 queue with preemptive-resume scheduling and two priority classes. Customers are strategic and may join the premium class for a fee. ... than the pure equilibria). ... Based upon the formula for waiting in an M |G|1 queue with no preemption [9, p.164] , one can derive the resulting cost function C(φ) and expected average wait time E[W ] as follows: C(φ) = Kρ 2 2µ(1 ...arXiv:2002.12914v2 fatcat:cgbfd3xxczb6rgmnqx34q4s4hu
(ii) selling a position in the queue could be more profitable to the server than selling a priority. ... Characterizing the symmetric Nash equilibrium strategies is much harder than in other priority queueing systems analyzed in the literature. ... him in the ordinary queue, and no customers in the priority queue. ...doi:10.1109/tac.2015.2419151 fatcat:icg7i5llnbb3rbsyyu44kolsmu
By using stochastic dynamic programming, a functional equation for the optimal, state-dependent priority assignment policy is derived. ... Pure Appl. Math. Sci. 23 (1986), no. 1-2, 77-88. This is a typical paper of queueing models of the period of the fifties and sixties. ...
To achieve near-optimal performance, we design a two-stage machine learning algorithm to first automatically cluster flows with the similar flow size distribution and then predict the priorities of flows ... Based on this investigation, we present Traffic Prediction based Flow Scheduling (TPFS), aiming at achieving near-optimal performance and good generality in multi-tenant data centers with the mix-traffic ... Once we know the cumulative density function of flow size distribution F(x), we can determine a series of thresholds that classify flows into priority queues based on their sent bytes x. ...doi:10.1109/access.2020.2984277 fatcat:kjvnoi3nvncp5hqb74wzunlm5u
Next, we consider a system offering L levels of priority service with a FCFS queue for each priority level. Higher priorities are charged higher admission prices. ... Numerical results show that with only three queues the server can attain near maximum revenue. ... Also plotted in Figure 1 is the optimal arrival time as a function of the customer type when there is only a single queue. ...arXiv:1704.05986v2 fatcat:z4wm762edja2zgudrsfrenmxpu
We consider a memoryless single server queue in which users can purchase relative priority so as to reduce their expected waiting costs which are linear with time. ... Relative priority is given in proportion to a price paid by customers present in the system. ... Since customers' optimal price is a function of the payments made (and to be made) by others, the solution concept to adopt here is the (symmetric) Nash equilibrium. ...doi:10.1017/s0269964800004940 fatcat:pmr3arzskbbongr6kgnjwizsfa
« Previous Showing results 1 — 15 out of 14,946 results