1723 search results - page 208 / 345 » Cycling in linear programming problems |
101
click to vote
TROB
2010
14 years 8 months ago
2010
—Robotic systems need to be able to plan control actions that are robust to the inherent uncertainty in the real world. This uncertainty arises due to uncertain state estimation,...
PARA
1995
Springer
15 years 1 months ago
1995
Springer
Abstract. ScaLAPACK is a library of high performance linear algebra routines for distributed memory MIMD computers. It is a continuation of the LAPACK project, which designed and p...
169
click to vote
CONCUR
2011
Springer
13 years 9 months ago
2011
Springer
The problem of model checking threads interacting purely via the standard synchronization primitives is key for many concurrent program analyses, particularly dataflow analysis. U...
ALDT
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
101
click to vote
SODA
2003
ACM
14 years 11 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...