Results 131 to 140 of about 417 (162)

Deep reinforcement learning can promote sustainable human behaviour in a common-pool resource problem. [PDF]

Nat Commun
Koster R, Pîslar M, Tacchetti A, Balaguer J, Liu L, Elie R, Hauser OP, Tuyls K, Botvinick M, Summerfield C.   +9 more
europepmc   +1 more source

Perceived Impacts of Climate Change in Pastoralist Regions of Ethiopia: A Qualitative Study Applying the Concept of One Health. [PDF]

Int J Environ Res Public Health
Tamire M, Mor SM, Baylis M, Kaba M.
europepmc   +1 more source

Overall time spent by clients from entry to exit and associated factors in out-patient departments in public hospitals of Jimma Zone southwest, Ethiopia. [PDF]

PLoS One
Walle Z, Worku F, Sraneh Y, Melese D, Fufa T, Yesuf EA, Berihun G.   +6 more
europepmc   +1 more source

Desiring support on a winding road with challenging intersections: Social and professional support for sexual minority forced migrant men. [PDF]

J Adv Nurs
Carlsson T, Isaac R, Ainembabazi R, Eldebo A, Yasin S, Gottvall M.   +5 more
europepmc   +1 more source

A Two-Population Game in Observable Double-Ended Queueing Systems

A Two-Population Game in Observable Double-Ended Queueing Systems
openaire  

Some of the next articles are maybe not open access.

Related searches:

Double-ended queues with impatience

Computers and Operations Research, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
P R Parthasarathy
exaly   +3 more sources

Catenable double-ended queues

ACM SIGPLAN Notices, 1997
Catenable double-ended queues are double-ended queues (deques) that support catenation (i.e., append) efficiently without sacrificing the efficiency of other operations. We present a purely functional implementation of catenable deques for which every operation, including catenation, takes O (1) amortized time ...
Chris Okasaki
exaly   +4 more sources

Improvements in double ended priority queues

International Journal of Computer Mathematics, 2003
In this paper, we present improved algorithms for min–max pair heaps introduced by S. Olariu et al. (A Mergeable Double-ended Priority Queue – The Comp. J. 34, 423–427, 1991). We also show that in the worst case, this structure, though slightly costlier to create, is better than min–max heaps of Strothotte (Min–max Heaps and Generalized Priority Queues
Rezaul Alam Chowdhury, M Kaykobad
exaly   +2 more sources

Double-ended queues with non-Poisson inputs and their effective algorithms

Computers and Operations Research, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Quan-Lin Li, Yan-Xia Chang
exaly   +3 more sources

The deap—a double-ended heap to implement double-ended priority queues

Information Processing Letters, 1987
Abstract This paper presents a symmetrical implicit double-ended priority queue implementation, which can be built in linear time. The smallest and the largest element can be found in constant time, and deleted in logarithmic time. This structure is an improvement of the MinMaxHeap presented by Atkinson et al. (1986).
Svante Carlsson
exaly   +2 more sources