519 search results - page 19 / 104 » A New Approach to Strongly Polynomial Linear Programming |
AIPS
2008
15 years 3 months ago
2008
Planning problems are often formulated as heuristic search. The choice of the heuristic function plays a significant role in the performance of planning systems, but a good heuris...
103
click to vote
FCT
2007
Springer
15 years 7 months ago
2007
Springer
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
106
click to vote
UAI
2008
15 years 2 months ago
2008
Approximate linear programming (ALP) is an efficient approach to solving large factored Markov decision processes (MDPs). The main idea of the method is to approximate the optimal...
129
click to vote
MP
2007
15 years 29 days ago
2007
The selection of the branching variable can greatly affect the speed of the branch and bound solution of a mixed-integer or integer linear program. Traditional approaches to branc...
112
click to vote
PPOPP
2009
ACM
16 years 2 months ago
2009
ACM
This paper introduces a new way to provide strong atomicity in an implementation of transactional memory. Strong atomicity lets us offer clear semantics to programs, even if they ...