Sciweavers

70 search results - page 2 / 14
» Approximation Reformulations
Sort
View
CDC
2008
IEEE
137views Control Systems» more  CDC 2008»
14 years 5 months ago
An approximate dynamic programming approach to probabilistic reachability for stochastic hybrid systems
— This paper addresses the computational overhead involved in probabilistic reachability computations for a general class of controlled stochastic hybrid systems. An approximate ...
Alessandro Abate, Maria Prandini, John Lygeros, Sh...
LPNMR
2005
Springer
14 years 4 months ago
An Algebraic Account of Modularity in ID-Logic
ID-logic uses ideas from the field of logic programming to extend second order logic with non-monotone inductive defintions. In this work, we reformulate the semantics of this lo...
Joost Vennekens, Marc Denecker
SARA
2009
Springer
14 years 5 months ago
Some Interval Approximation Techniques for MINLP
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
Nicolas Berger, Laurent Granvilliers
CVPR
1999
IEEE
15 years 23 days ago
Factorization as a Rank 1 Problem
Tomasi and Kanade [1] introduced the factorization method for recovering 3D structure from 2D video. In their formulation, the 3D shape and 3D motion are computed by using an SVD ...
Pedro M. Q. Aguiar, José M. F. Moura
ISCC
2005
IEEE
143views Communications» more  ISCC 2005»
14 years 4 months ago
Approximating Optimal Multicast Trees in Wireless Multihop Networks
— We study the problem of computing minimal cost multicast trees in multi-hop wireless mesh networks. This problem is known as the Steiner tree problem, and it has been widely st...
Pedro M. Ruiz, Antonio F. Gómez-Skarmeta