Sciweavers

5 search results - page 1 / 1
» Controlled perturbation for arrangements of circles
Sort
View
COMPGEOM
2003
ACM
13 years 10 months ago
Controlled perturbation for arrangements of circles
Given a collection C of circles in the plane, we wish to construct the arrangement A(C) (namely the subdivision of the plane into vertices, edges and faces induced by C) using fl...
Dan Halperin, Eran Leiserowitz
CDC
2009
IEEE
149views Control Systems» more  CDC 2009»
13 years 9 months ago
Robust stabilization of model-based uncertain singularly perturbed systems with networked time-delay
—In this paper, a robust stabilization of the uncertain singularly perturbed system via a networked state feedback with the transmission time-delay is addressed. Taking its nomin...
Zhiming Wang, Wei Liu, Haohui Dai, D. Subbaram Nai...
ISSAC
1998
Springer
101views Mathematics» more  ISSAC 1998»
13 years 9 months ago
Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...
Markus A. Hitz, Erich Kaltofen
CDC
2009
IEEE
176views Control Systems» more  CDC 2009»
13 years 9 months ago
Controllability of the rotation of a quantum planar molecule
Abstract— We consider the simplest model for controlling the rotation of a molecule by the action of an electric field, namely a quantum planar pendulum. This problem consists i...
Ugo V. Boscain, Thomas Chambrion, Paolo Mason, Mar...
COMPGEOM
2004
ACM
13 years 10 months ago
On locally Delaunay geometric graphs
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
Rom Pinchasi, Shakhar Smorodinsky