Sciweavers

3049 search results - page 13 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
CDC
2009
IEEE
379views Control Systems» more  CDC 2009»
13 years 10 months ago
Receding horizon cost optimization for overly constrained nonlinear plants
— A receding horizon control algorithm, originally proposed for tracking best-possible steady-states in the presence of overly stringent state and/or input constraints, is analyz...
David Angeli, Rishi Amrit, James B. Rawlings
PAMI
2006
145views more  PAMI 2006»
13 years 7 months ago
Convergent Tree-Reweighted Message Passing for Energy Minimization
Algorithms for discrete energy minimization are of fundamental importance in computer vision. In this paper we focus on the recent technique proposed by Wainwright et al. [33] - t...
Vladimir Kolmogorov
RC
2007
83views more  RC 2007»
13 years 7 months ago
Computing the Pessimism of Inclusion Functions
Abstract. “Computing the pessimism” means bounding the overestimation produced by an inclusion function. There are two important distinctions with classical error analysis. Fir...
Gilles Chabert, Luc Jaulin
CDC
2008
IEEE
144views Control Systems» more  CDC 2008»
14 years 2 months ago
On the convergence time of distributed quantized averaging algorithms
— We come up with novel quantized averaging algorithms on synchronous and asynchronous communication networks with fixed, switching and random topologies. The implementation of ...
Minghui Zhu, Sonia Martínez
IFM
2010
Springer
147views Formal Methods» more  IFM 2010»
13 years 5 months ago
Symbolic Model-Checking of Optimistic Replication Algorithms
Abstract. The Operational Transformation (OT) approach, used in many collaborative editors, allows a group of users to concurrently update replicas of a shared object and exchange ...
Hanifa Boucheneb, Abdessamad Imine, Manal Najem