Sciweavers

850 search results - page 75 / 170
» Constraint propagation on quadratic constraints
Sort
View
ATAL
2007
Springer
14 years 1 months ago
Hypotheses refinement under topological communication constraints
We investigate the properties of a multiagent system where each (distributed) agent locally perceives its environment. Upon perception of an unexpected event, each agent locally c...
Gauvain Bourgne, Gael Hette, Nicolas Maudet, Suzan...
AAAI
2008
13 years 11 months ago
Anytime Local Search for Distributed Constraint Optimization
Most former studies of Distributed Constraint Optimization Problems (DisCOPs) search considered only complete search algorithms, which are practical only for relatively small prob...
Roie Zivan
AUTOMATICA
2007
110views more  AUTOMATICA 2007»
13 years 9 months ago
Stability analysis of systems with uncertain time-varying delays
Stability in presence of bounded uncertain time-varying delays in the feedback loop of a system is studied. The delay parameter is assumed to be an unknown time-varying function f...
Chung-Yao Kao, Anders Rantzer
AUTOMATICA
2002
104views more  AUTOMATICA 2002»
13 years 8 months ago
Who needs QP for linear MPC anyway?
Conventional MPC uses quadratic programming (QP) to minimise, on-line, a cost over n linearly constrained control moves. However, stability constraints often require the use of la...
Basil Kouvaritakis, Mark Cannon, J. Anthony Rossit...
OL
2011
177views Neural Networks» more  OL 2011»
12 years 12 months ago
Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of proce
In this paper we present a methodology for finding tight convex relaxations for a special set of quadratic constraints given by bilinear and linear terms that frequently arise in ...
Juan P. Ruiz, Ignacio E. Grossmann