Sciweavers

3221 search results - page 335 / 645
» Termination of Linear Programs
Sort
View
INFORMS
2010
125views more  INFORMS 2010»
15 years 5 months ago
Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
We develop a solution approach for the fixed charge network flow problem (FCNF) that produces provably high-quality solutions quickly. The solution approach combines mathematica...
Mike Hewitt, George L. Nemhauser, Martin W. P. Sav...
POPL
2010
ACM
16 years 1 months ago
Compress-and-conquer for optimal multicore computing
We propose a programming paradigm called compress-and-conquer (CC) that leads to optimal performance on multicore platforms. Given a multicore system of p cores and a problem of s...
Zhijing G. Mou, Hai Liu, Paul Hudak
PODC
2005
ACM
16 years 5 days ago
Facility location: distributed approximation
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
Thomas Moscibroda, Roger Wattenhofer
KR
1998
Springer
15 years 10 months ago
Probabilistic Deduction with Conditional Constraints over Basic Events
We study the problem of probabilistic deduction with conditional constraints over basic events. We show that globallycomplete probabilistic deduction with conditional constraints ...
Thomas Lukasiewicz
AI
1999
Springer
15 years 6 months ago
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
Rina Dechter