219 search results - page 10 / 44 » Solving Semi-infinite Linear Programs Using Boosting-Like Me... |
CP
2004
Springer
14 years 27 days ago
2004
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
NIPS
2003
13 years 8 months ago
2003
— One way of image denoising is to project a noisy image to the subspace of admissible images derived, for instance by PCA. However, a major drawback of this method is that all p...
SIAMSC
2008
13 years 7 months ago
2008
We present a two-phase algorithm for solving large-scale quadratic programs (QPs). In the first phase, gradient-projection iterations approximately minimize an augmented Lagrangian...
JMLR
2006
13 years 7 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
ISCAS
2005
IEEE
14 years 1 months ago
2005
IEEE
— Piecewise linear Lyapunov functions are used to design control gain matrices so that closed systems are robust stable and attractive regions are expanded as large as possible i...