Results 241 to 250 of about 2,927,287 (293)
Some of the next articles are maybe not open access.
Randomized allocation processes
Random Structures & Algorithms, 2001Abstract Many dynamic resource allocation and on‐line load balancing problems can be modeled by processes that sequentially allocate balls into bins. The balls arrive one by one and are to be placed into bins on‐line without using a centralized controller.
Artur Czumaj, Volker Stemann
openaire +2 more sources
Presenting Objects for Random Allocation
Journal of Public Economic Theory, 2022For random allocation, whether a desirable rule exists hinges on the domain of agents' preferences, whose formation is affected by how objects are presented. We hence propose a model studying how to present objects so that the induced preference domain allows for designing a good rule. Motivated by practices in reality, we model the objects as
Peng Liu, Sijia Xu
openaire +1 more source
BMJ, 2009
A randomised single blind controlled trial investigated whether pelvic floor muscle training during pregnancy prevented urinary incontinence during and after pregnancy. The trial recruited healthy nulliparous women when they attended their first routine ultrasound.
openaire +1 more source
A randomised single blind controlled trial investigated whether pelvic floor muscle training during pregnancy prevented urinary incontinence during and after pregnancy. The trial recruited healthy nulliparous women when they attended their first routine ultrasound.
openaire +1 more source
Random Arc Allocation and Applications
2002The paper considers a generalization of the well known random placement of balls into bins. Given n circular arcs of lengths ?1, ..., ?n we study the maximum number of overlapping arcs on a circle if the starting points of the arcs are chosen randomly. We give almost exact tail bounds on the maximum overlap of the arcs.
Peter Sanders 0001, Berthold Vöcking
openaire +2 more sources
Random allocations and probabilistic languages
1988This paper introduces a unified framework for the analysis of a class of random allocation processes that include: (i) the birthday paradox; (ii) the coupon collector problem; (iii) least-recently-used (LRU) caching in memory management systems under the independent reference model; (iv) the move-to-front heuristic of self-organizing search.
Philippe Flajolet +2 more
openaire +1 more source

