427 search results - page 73 / 86 » A Subexponential Bound for Linear Programming |
CPAIOR
2006
Springer
14 years 16 days ago
2006
Springer
We show that various duals that occur in optimization and constraint satisfaction can be classified as inference duals, relaxation duals, or both. We discuss linear programming, su...
IOR
2007
13 years 8 months ago
2007
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
ICML
2007
IEEE
14 years 9 months ago
2007
IEEE
In this paper, we present an information-theoretic approach to learning a Mahalanobis distance function. We formulate the problem as that of minimizing the differential relative e...
ICCAD
2003
IEEE
14 years 5 months ago
2003
IEEE
– Many embedded system designs usually impose (hard) read-time constraints on tasks. Thus, computing a tight upper bound of the worst case execution time (WCET) of a software is ...
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
Recent advances in scene understanding and related tasks
have highlighted the importance of using regions to reason
about high-level scene structure. Typically, the regions are
...