Sciweavers

14121 search results - page 512 / 2825
» Interval Computations in Computer Vision
Sort
View
ISAAC
1999
Springer
91views Algorithms» more  ISAAC 1999»
15 years 11 months ago
Convexifying Monotone Polygons
This paper considers recon gurations of polygons, where each polygon edge is a rigid link, no two of which can cross during the motion. We prove that one can recon gure any monoton...
Therese C. Biedl, Erik D. Demaine, Sylvain Lazard,...
IPCO
2004
93views Optimization» more  IPCO 2004»
15 years 8 months ago
Semi-continuous Cuts for Mixed-Integer Programming
We study the convex hull of the feasible set of the semi-continuous knapsack problem, in which the variables belong to the union of two intervals. Besides being important in its o...
I. R. de Farias
FMICS
2010
Springer
15 years 7 months ago
Range Analysis of Microcontroller Code Using Bit-Level Congruences
Bitwise instructions, loops and indirect data access pose difficult challenges to the verification of microcontroller programs. In particular, it is necessary to show that an indir...
Jörg Brauer, Andy King, Stefan Kowalewski
AUTOMATICA
2007
84views more  AUTOMATICA 2007»
15 years 7 months ago
Nonsmooth optimization for multiband frequency domain control design
Multiband frequency domain synthesis consists in the minimization of a finite family of closed-loop transfer functions on prescribed frequency intervals. This is an algorithmical...
Pierre Apkarian, Dominikus Noll
SCHEDULING
2010
116views more  SCHEDULING 2010»
15 years 5 months ago
Characterizing sets of jobs that admit optimal greedy-like algorithms
The “ Priority Algorithm” is a model of computation introduced by Borodin, Nielsen and Rackoff [BNR03] which formulates a wide class of greedy algorithms. For an arbitrary se...
Periklis A. Papakonstantinou, Charles Rackoff