270 search results - page 43 / 54 » Constraint relaxation in approximate linear programs |
CCE
2006
13 years 7 months ago
2006
In this paper, we address the problem of optimal synthesis of an integrated water system, where water using processes and water treatment operations are combined into a single net...
CDC
2009
IEEE
14 years 3 days ago
2009
IEEE
— Timed Continuous Petri Net (TCPN) systems are piecewise linear models with input constraints that can approximate the dynamical behavior of a class of timed discrete event syst...
IJCAI
1997
13 years 8 months ago
1997
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
UAI
1997
13 years 8 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...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming probl...