Sciweavers

1142 search results - page 43 / 229
» Approximability of Clausal Constraints
Sort
View
AUTOMATICA
2006
73views more  AUTOMATICA 2006»
15 years 2 months ago
Robust MPC of constrained discrete-time nonlinear systems based on approximated reachable sets
A robust MPC for constrained nonlinear systems with uncertainties is presented. Outer bounds of the reachable sets of the system are used to predict the evolution of the system un...
J. M. Bravo, T. Alamo, Eduardo F. Camacho
TCBB
2008
73views more  TCBB 2008»
15 years 1 months ago
Nature Reserve Selection Problem: A Tight Approximation Algorithm
The Nature Reserve Selection Problem is a problem that arises in the context of studying biodiversity conservation. Subject to budgetary constraints, the problem is to select a set...
Magnus Bordewich, Charles Semple
TCS
2008
15 years 1 months ago
Approximate GCDs of polynomials and sparse SOS relaxations
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
Bin Li, Jiawang Nie, Lihong Zhi
ICCAD
2001
IEEE
107views Hardware» more  ICCAD 2001»
15 years 11 months ago
A Convex Programming Approach to Positive Real Rational Approximation
As system integration evolves and tighter design constraints must be met, it becomes necessary to account for the non-ideal behavior of all the elements in a system. Certain devic...
Carlos P. Coelho, Joel R. Phillips, Luis Miguel Si...
TALG
2010
110views more  TALG 2010»
15 years 10 days ago
Approximating fractional hypertree width
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
Dániel Marx