270 search results - page 31 / 54 » Constraint relaxation in approximate linear programs |
149
click to vote
CP
2005
Springer
15 years 6 months ago
2005
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
111
click to vote
STOC
2006
ACM
16 years 23 days ago
2006
ACM
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
89
Voted
CDC
2009
IEEE
15 years 5 months ago
2009
IEEE
— The task in control allocation is to determine how to generate a specified generalized force from a redundant set of control effectors where the associated actuator control in...
118
Voted
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
110
Voted
ICCV
2005
IEEE
16 years 2 months ago
2005
IEEE
The goal of this work is to recover human body configurations from static images. Without assuming a priori knowledge of scale, pose or appearance, this problem is extremely chall...