Results 1  10
of
229,907
Discounted deterministic Markov decision processes and discounted allpairs shortest paths
 ACM Transcations on Algorithms
"... We present two new algorithms for finding optimal strategies for discounted, infinitehorizon, Deterministic Markov Decision Processes (DMDP). The first one is an adaptation of an algorithm of Young, Tarjan and Orlin for finding minimum mean weight cycles. It runs in O(mn + n 2 log n) time, where n ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
We present two new algorithms for finding optimal strategies for discounted, infinitehorizon, Deterministic Markov Decision Processes (DMDP). The first one is an adaptation of an algorithm of Young, Tarjan and Orlin for finding minimum mean weight cycles. It runs in O(mn + n 2 log n) time, where n
Parametric linear programming and anticycling pivoting rules
 MATHEMATICAL PROGRAMMING
, 1988
"... The traditional perturbation (or lexicographic) methods for resolving degeneracy in linear programming impose decision rules that eliminate ties in the simplex ratio rule and, therefore, restrict the choice of exiting basic variables. Bland's combinatorial pivoting rule also restricts the choic ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The traditional perturbation (or lexicographic) methods for resolving degeneracy in linear programming impose decision rules that eliminate ties in the simplex ratio rule and, therefore, restrict the choice of exiting basic variables. Bland's combinatorial pivoting rule also restricts
Deterministic processor scheduling
 ACM Computing Surveys
, 1977
"... This paper surveys the deterministic scheduling of jobs m uniprocessor, multiprocessor, and jobshop environments. The survey begins with a brief introduction to the representation of task or job sets, followed by a discussion of classification categories. These categories include number of processo ..."
Abstract

Cited by 46 (0 self)
 Add to MetaCart
This paper surveys the deterministic scheduling of jobs m uniprocessor, multiprocessor, and jobshop environments. The survey begins with a brief introduction to the representation of task or job sets, followed by a discussion of classification categories. These categories include number
Finite Pivot Algorithms and Feasibility
, 2001
"... This thesis studies the classical finite pivot methods for solving linear programs and their efficiency in attaining primal feasibility. We review Dantzig’s largestcoefficient simplex method, Bland’s smallestindex rule, and the leastindex crisscross method. We present the b'rule: a simple ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This thesis studies the classical finite pivot methods for solving linear programs and their efficiency in attaining primal feasibility. We review Dantzig’s largestcoefficient simplex method, Bland’s smallestindex rule, and the leastindex crisscross method. We present the b'rule: a simple
On network simplex method using primaldual symmetric pivoting rule
 Journal of Operations Research of Japan
, 2000
"... Abstract We consider a network simplex method using the primaldual symmetric pivoting rule proposed by Chen, Pardalos, and Saunders. For minimumcost networkflow problems, we prove global convergence of the algorithm and propose a new scheme in which the algorithm can start from an arbitrary pair ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract We consider a network simplex method using the primaldual symmetric pivoting rule proposed by Chen, Pardalos, and Saunders. For minimumcost networkflow problems, we prove global convergence of the algorithm and propose a new scheme in which the algorithm can start from an arbitrary pair
Clustering for Faster Network Simplex Pivots
, 2000
"... We show how to use a combination of treeclustering techniques and computational geometry to improve the time bounds for optimal pivot selection in the primal network simplex algorithm for minimumcost flow and related problems and for pivot execution in the dual network simplex algorithm, from O(m) ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
We show how to use a combination of treeclustering techniques and computational geometry to improve the time bounds for optimal pivot selection in the primal network simplex algorithm for minimumcost flow and related problems and for pivot execution in the dual network simplex algorithm, from O
Minimum Ratio Contours For Meshes
, 2006
"... We present a novel minimum ratio contour (MRC) algorithm, for discretely optimizing contours on the surface of triangle meshes. We compute the contour having the minimal ratio between a numerator and a denominator energy. The numerator energy measures the bending and salience (feature adaptation) of ..."
Abstract
 Add to MetaCart
We present a novel minimum ratio contour (MRC) algorithm, for discretely optimizing contours on the surface of triangle meshes. We compute the contour having the minimal ratio between a numerator and a denominator energy. The numerator energy measures the bending and salience (feature adaptation
Results 1  10
of
229,907