Zobrazeno 1 - 10
of 48
pro vyhledávání: '"Bouman, Niek"'
Autor:
Bernstein, Andrey, Bouman, Niek J.
This paper considers a discrete-time decision problem wherein a decision maker has to track, on average, a sequence of inputs selected from a convex set $\mathcal X \subset \mathbb{R}^d$ by choosing actions from a possibly non-convex feasible set $\m
Externí odkaz:
http://arxiv.org/abs/1811.07734
Autor:
Bouman, Niek J.
We describe a new C++ library for multiprecision arithmetic for numbers in the order of 100--500 bits, i.e., representable with just a few limbs. The library is written in "optimizing-compiler-friendly" C++, with an emphasis on the use of fixed-size
Externí odkaz:
http://arxiv.org/abs/1804.07236
We consider a two-level discrete-time control framework with real-time constraints where a central controller issues setpoints to be implemented by local controllers. The local controllers implement the setpoints with some approximation and advertize
Externí odkaz:
http://arxiv.org/abs/1612.07287
We target the problem of controlling electrical microgrids with little inertia in real time. We consider a central controller and a number of resources, where each resource is either a load, a generator, or a combination thereof, like a battery. The
Externí odkaz:
http://arxiv.org/abs/1511.08628
We explore the achievable delay performance in wireless random-access networks. While relatively simple and inherently distributed in nature, suitably designed queue-based random-access schemes provide the striking capability to match the optimal thr
Externí odkaz:
http://arxiv.org/abs/1305.3774
We consider a broad class of queueing models with random state-dependent vacation periods, which arise in the analysis of queue-based back-off algorithms in wireless random-access networks. In contrast to conventional models, the vacation periods may
Externí odkaz:
http://arxiv.org/abs/1302.3144
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
Externí odkaz:
http://arxiv.org/abs/1302.2824
We explore the minimum energy configurations of repelling particles distributed over n possible locations forming a toric grid. We conjecture that the most energy-efficient way to distribute n/2 particles over this space is to place them in a checker
Externí odkaz:
http://arxiv.org/abs/1203.0408
Entropic uncertainty relations are quantitative characterizations of Heisenberg's uncertainty principle, which make use of an entropy measure to quantify uncertainty. In quantum cryptography, they are often used as convenient tools in security proofs
Externí odkaz:
http://arxiv.org/abs/1105.6212
We examine the stability of wireless networks whose users are distributed over a compact space. A subset of users is called {\it admissible} when their simultaneous activity obeys the prevailing interference constraints and, in each time slot, an adm
Externí odkaz:
http://arxiv.org/abs/1012.3364