In this work we study the Capacitated p-Center Problem (CpCP) and we propose an exact algorithm to solve it. We study two auxiliary problems and their relation to CpCP, and we pro...
Advances in the direct computation of Lyapunov functions using convex optimization make it possible to efficiently evaluate regions of attraction for smooth nonlinear systems. Her...
Russ Tedrake, Ian R. Manchester, Mark Tobenkin, Jo...
In the original formulation of influence diagrams (IDs), each model contained exactly one utility node. Tatman and Shachter (1990), introduced the possibility of having super-valu...
This paper summarizes and compares techniques for detecting and identifying markers in the context of computer vision. Existing approaches use correlation, digital, or topological...
In this paper, we study the performances of the NEW Unconstrained Optimization Algorithm (NEWUOA) with different numbers of interpolation points. NEWUOA is a trust region method, ...