356 search results - page 14 / 72 » On the Global Solution of Linear Programs with Linear Comple... |
FOCS
1991
IEEE
14 years 5 days ago
1991
IEEE
We perform linear programming optimizations on the intersection of k polyhedra in R3 , represented by their outer recursive decompositions, in expected time O(k log k log n + √ ...
AIPS
2004
13 years 10 months ago
2004
Approximate linear programming (ALP) offers a promising framework for solving large factored Markov decision processes (MDPs) with both discrete and continuous states. Successful ...
TPDS
2008
2008
Linear Programming-Based Affinity Scheduling of Independent Tasks on Heterogeneous Computing Systems
13 years 8 months ago
Abstract-- Resource management systems (RMS) are an important component in heterogeneous computing (HC) systems. One of the jobs of an RMS is the mapping of arriving tasks onto the...
EMNLP
2010
13 years 6 months ago
2010
This paper introduces dual decomposition as a framework for deriving inference algorithms for NLP problems. The approach relies on standard dynamic-programming algorithms as oracl...
ASPDAC
2000
ACM
14 years 1 months ago
2000
ACM
Global placement of hypergraphs is critical in the top-down placement of large timing-driven designs 10, 16 . Placement quality is evaluated in terms of the half-perimeter wirelen...