1,862 results for optima · 0.123s

arxiv.org/abs/2106.10971v1

Near-Optimal Pool Testing under Urgency Constraints

Detection of rare traits or diseases in a large population is challenging. Pool testing allows covering larger swathes of population at a reduced cost, while simplifying logistics. However, testing precision decreases as it becomes unclear which memb...

Sponsored Partners
arxiv.org/abs/1701.09064v3

Local incompressibility estimates for the Laughlin phase

We prove sharp density upper bounds on optimal length-scales for the ground states of classical 2D Coulomb systems and generalizations thereof. Our method is new, based on an auxiliary Thomas-Fermi-like variational model. Moreover, we deduce density...

www.bing.com/ck/a?!&&p=020ed248040a46ac391d048d322dfabcdc6038a216b3411cafb36754cfa2c28aJmltdHM9MTc3Mjg0MTYwMA&ptn=3&ver=2&hsh=4&fclid=11fcd32b-ac6e-6589-37b7-c43dad086490&u=a1aHR0cHM6Ly93d3cubG9naXRlY2hnLmNvbS9lbi11cy9zb2Z0d2FyZS9naHVi&ntb=1

G HUB Gaming Software| Logitech G

Unlock full potential with G HUB! Customize Logitech G gear: mouse, keyboard, headset, webcam settings. Create and share profiles for optimal gaming.

arxiv.org/abs/1004.2392v1

On the optimal stacking of noisy observations

Observations where additive noise is present can for many models be grouped into a compound observation matrix, adhering to the same type of model. There are many ways the observations can be stacked, for instance vertically, horizontally, or quadrat...

arxiv.org/abs/2103.02253v1

Optimal Kidney Exchange with Immunosuppressants

Algorithms for exchange of kidneys is one of the key successful applications in market design, artificial intelligence, and operations research. Potent immunosuppressant drugs suppress the body's ability to reject a transplanted organ up to the point...

arxiv.org/abs/2212.01808v2

Optimal Acceptance of Incompatible Kidneys

Incompatibility between patient and donor is a major barrier in kidney transplantation (KT). The increasing shortage of kidney donors has driven the development of desensitization techniques to overcome this immunological challenge. Compared with com...

arxiv.org/abs/1105.5809v2

The Doors

We emphasize the dominance in the Monty Hall problem, both in the classical scenario and its multi-door generalization. This is used to show optimality of the class of always-switching strategies for nonuniform allocation of the prize and arbitrary d...

arxiv.org/abs/1204.5519v1

Optimal Mechanisms for Selling Information

The buying and selling of information is taking place at a scale unprecedented in the history of commerce, thanks to the formation of online marketplaces for user data. Data providing agencies sell user information to advertisers to allow them to mat...

arxiv.org/abs/1107.5066v1

The Fighter Problem: Optimal Allocation of a Discrete Commodity

The Fighter problem with discrete ammunition is studied. An aircraft (fighter) equipped with $n$ anti-aircraft missiles is intercepted by enemy airplanes, the appearance of which follows a homogeneous Poisson process with known intensity. If $j$ of t...

arxiv.org/abs/1605.05173v1

Early Stopping for Interleaver Recovering of Turbo Codes

Parameter recovering of channel codes is important in applications such as cognitive radio. The main task for that of a turbo code is to recover the interleaver. The existing optimal algorithm recovers interleaver parameters incrementally one by one....

arxiv.org/abs/math/0603083v1

Universal optimality of Patterson's crossover designs

We show that the balanced crossover designs given by Patterson [Biometrika 39 (1952) 32--48] are (a) universally optimal (UO) for the joint estimation of direct and residual effects when the competing class is the class of connected binary designs...

arxiv.org/abs/1302.2824v2

Lingering Issues in Distributed Scheduling

Recent advances have resulted in queue-based algorithms for medium access control which operate in a distributed fashion, and yet achieve the optimal throughput performance of centralized scheduling algorithms. However, fundamental performance bounds...

arxiv.org/abs/2407.07293v2

Optimal Decision Mechanisms for Committees: Acquitting the Guilty

A group of privately informed agents chooses between two alternatives. How should the decision rule be designed if agents are known to be biased in favor of one of the options? We address this question by considering the Condorcet Jury Setting as a m...