We give a polynomial-time algorithm to find a shortest contractible cycle (i.e. a closed walk without repeated vertices) in a graph embedded in a surface. This answers a question ...
Abstract—In this contribution, we propose an original algorithm for self-localization in mobile ad-hoc networks. The proposed technique, based on interval analysis, is suited to ...
A wide variety of stability and performance questions about linear dynamical systems can be reformulated as convex optimization problems involving linear matrix inequalities (LMIs...
Erin M. Aylward, Pablo A. Parrilo, Jean-Jacques E....
This paper focuses on load management in looselycoupled federated distributed systems. We present a distributed mechanism for moving load between autonomous participants using bil...
Magdalena Balazinska, Hari Balakrishnan, Michael S...
The expression of contracts in computer readable form, and the development of automated tests for completeness and well-formedness of contracts, has opened the door to significant...