Country: United States

Found 17049 papers in total
A polynomial combinatorial algorithm for generalized minimum cost flow
A polynomial combinatorial algorithm for generalized minimum cost flow
2002,
We propose the first combinatorial solution to the generalized minimum cost flow...
Faster algorithms for the generalized network flow problem
Faster algorithms for the generalized network flow problem
1998,
We consider the generalized network flow problem. Each arc e in the network has a gain...
Scaling methods for finding a maximum free multiflow of minimum cost
Scaling methods for finding a maximum free multiflow of minimum cost
1997,
Suppose we are given an undirected graph with nonnegative integer-valued edge...
The stable allocation (or ordinal transportation) problem
The stable allocation (or ordinal transportation) problem
2002,
The stable allocation problem generalizes the 0,1 stable matching problems...
On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
1998,
We derive some basic results on the geometry of semidefinite programming (SDP) and...
Perfect and ideal 0, +/− 1 matrices
Perfect and ideal 0, +/− 1 matrices
1998,
A 0, +/−1 matrix A is said to be perfect (resp. ideal) if the corresponding...
A note on the convergence of policy iteration in Markov decision processes with compact action spaces
A note on the convergence of policy iteration in Markov decision processes with compact action spaces
2003,
The undiscounted, unichain, finite state Markov decision process with compact action...
The complexity of decentralized control of Markov decision processes
The complexity of decentralized control of Markov decision processes
2002,
We consider decentralized control of Markov decision processes and give complexity...
Achieving target state-action frequencies in multichain average-reward Markov decision processes
Achieving target state-action frequencies in multichain average-reward Markov decision processes
2002,
In this paper we address a basic problem that arises naturally in average-reward...
A homological characterization of Q-matrices
A homological characterization of Q-matrices
1998,
A real square matrix M is said to be a e-matrix if the linear complementarity problem...
The throughput of irreducible closed Markovian queueing networks: Functional bounds, asymptotic loss, efficiency, and the Harrison–Wein conjectures
The throughput of irreducible closed Markovian queueing networks: Functional bounds, asymptotic loss, efficiency, and the Harrison–Wein conjectures
1997,
Let N be the population of an irreducible closed Markovian queueing network, and...
How does the value function of a Markov decision depend on the transition probabilities?
How does the value function of a Markov decision depend on the transition probabilities?
1997,
The present work deals with the comparison of (discrete time) Markov decision...
Optimal adaptive policies for Markov decision processes
Optimal adaptive policies for Markov decision processes
1997,
In this paper we consider the problem of adaptive control for Markov Decision...
Convergence of Markov chains in the relative supremum norm
Convergence of Markov chains in the relative supremum norm
2000,
It is proved that the strong Doeblin condition (i.e., p s (x, y) ≥ a s π(y) for...
Level–phase independence for GI/M/1-type Markov chains
Level–phase independence for GI/M/1-type Markov chains
2000,
GI/M/1-type Markov chains make up a class of two-dimensional Markov chains. One...
Families of birth–death processses with similar time-dependent behaviour
Families of birth–death processses with similar time-dependent behaviour
2000,
We consider birth–death processes taking values in 𝒩 ≡ {0, 1, ...},...
Reduction techniques for discrete-time Markov chains on totally ordered state space using stochastic comparisons
Reduction techniques for discrete-time Markov chains on totally ordered state space using stochastic comparisons
2000,
We propose in this paper two methods to compute Markovian bounds for monotone...
On some waiting time problems
On some waiting time problems
2000,
A unifying technology is introduced for finding explicit closed form expressions for...
A central limit theorem for iterated random functions
A central limit theorem for iterated random functions
2000,
A central limit theorem is established for additive functions of a Markov chain that...
Open-loop routeing to M parallel servers with no buffers
Open-loop routeing to M parallel servers with no buffers
2000,
In this paper we study the assignment of packets to M parallel heterogeneous servers...
Explicit bounds for geometric convergence of Markov chains
Explicit bounds for geometric convergence of Markov chains
2000,
This paper presents bounds on convergence rates of Markov chains in terms of...
Perturbed Markov processes
Perturbed Markov processes
2003,
A Markov process in discrete time is perturbed by a small parameter. A perturbation...
A new type of discrete self-decomposability and its application to continuous-time Markov processes for modeling count data time series
A new type of discrete self-decomposability and its application to continuous-time Markov processes for modeling count data time series
2003,
We propose a family of extended thinning operators, indexed by a parameter γ in...
β-invariant measures for transition matrices of GI/M/1 type
β-invariant measures for transition matrices of GI/M/1 type
2003,
In this paper, we study transition matrices of GI/M/ 1 type by using the approach...
Papers per page: