91 search results - page 2 / 19 » A dynamic inequality generation scheme for polynomial progra... |
CADE
2007
Springer
14 years 5 months ago
2007
Springer
We introduce a calculus for handling integer arithmetic in first-order logic. The method is tailored to Java program verification and meant to be used both as a supporting procedur...
ICRA
2007
IEEE
13 years 11 months ago
2007
IEEE
— We consider the problem of generating global feasible trajectories for nonholonomic mobile robots in the presence of moving obstacles. The global trajectory is composed of regi...
MP
2006
13 years 5 months ago
2006
Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to generate bounds for mixed-integer linear programmi...
UAI
1997
13 years 6 months ago
1997
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
AUTOMATICA
2008
13 years 5 months ago
2008
A wide variety of stability and performance questions about linear dynamical systems can be reformulated as convex optimization problems involving linear matrix inequalities (LMIs...