Related papers: Performance of near-optimal protocols in weak proc…

The optimal control of passive systems in equilibrium typically favours quasistatic (infinite-time) protocols. We show that a breakdown of quasistatic optimality occurs when the controller itself is dissipative. Concretely, we study a…

We give the first algorithm for testing the feasibility of a system of sporadic real-time tasks on a set of identical processors, solving one major open problem in the area of multiprocessor real-time scheduling [S.K. Baruah and K. Pruhs,…

We present a method for determining optimal modes of operation for autonomously oscillating systems with uncertain parameters. In a typical application of the method, a nonlinear dynamical system is optimized with respect to an economic…

The main purpose of this short article is to give a brief overview of the development of the very interesting weak measurement protocol. I add some comments relating to the reality of weak values, and also comment on the allowed values of…

Weakly activated signaling cascades can be modeled as linear systems. The input-to-output transfer function and the internal gain of a linear system, provide natural measures for the propagation of the input signal down the cascade and for…

We propose a protocol optimization technique that is applicable to both weighted or unweighted graphs. Our aim is to explore by how much a small variation around the Shortest Path or Optimal Path protocols can enhance protocol performance.…

This paper considers an optimization problem for a dynamical system whose evolution depends on a collection of binary decision variables. We develop scalable approximation algorithms with provable suboptimality bounds to provide…

In this paper, we consider the problem of scheduling an application on a parallel computational platform. The application is a particular task graph, either a linear chain of tasks, or a set of independent tasks. The platform is made of…

Here an original idea is suggested to prove the existence of optimal control for some types of non- linear problems. The obtained results can be considered as individual existence theorems (in some sense).

In the first part of this paper we introduced an algorithm that uses reachable set approximation to approximate the minimum time function of linear control problems. To illustrate the error estimates and to demonstrate differences to other…

Modern distributed systems rely on consensus protocols to build a fault-tolerant-core upon which they can build applications. Consensus protocols are correct under a specific failure model, where up to $f$ machines can fail. We argue that…

Traditionally, wireless network protocols have been designed for performance. Subsequently, as attacks have been identified, patches have been developed. This has resulted in an "arms race" development process of discovering vulnerabilities…

In this paper, we study robust distributed sub-optimal coordination of linear agents subject to input nonlinearities. Inspired by the robust agreement literature, we formulate a bounded distributed sub-optimal coordination problem, in which…

The linear functional strategy for the regularization of inverse problems is considered. For selecting the regularization parameter therein, we propose the heuristic quasi-optimality principle and some modifications including the smoothness…

A general achievable upper bound of extractable work under feedback control is given, where nonequilibrium equalities are generalized so as to be applicable to error-free measurements. The upper bound involves a term which arises from the…

Maximization of {\it non-submodular} functions appears in various scenarios, and many previous works studied it based on some measures that quantify the closeness to being submodular. On the other hand, many practical non-submodular…

Robust optimization provides a principled and unified framework to model many problems in modern operations research and computer science applications, such as risk measures minimization and adversarially robust machine learning. To use a…

We consider a hidden-action principal-agent model, in which actions require different amounts of effort, and the agent privately knows his ability that determines his cost of effort. We show that linear contracts admit approximation…

We prove boundedness and regularity estimates for weak solutions to a class of linear nonlocal equations involving integro-differential operators with almost no order of differentiability. In particular, we show that bounded weak solutions…

Parallel machine scheduling has been extensively studied in the past decades, with applications ranging from production planning to job processing in large computing clusters. In this work we study some of these fundamental optimization…