Country: United States

Found 17049 papers in total
Tail asymptotics for the busy period in the G1/G/1 queue
Tail asymptotics for the busy period in the G1/G/1 queue
2001,
We characterise the tail behaviour of the busy period distribution in the GI/G/1 queue...
Separating clique trees and bipartition inequalities having a fixed number of handles and teeth in polynomial time
Separating clique trees and bipartition inequalities having a fixed number of handles and teeth in polynomial time
1997,
Many important cutting planes have been discovered for the traveling salesman problem....
Continuous characterizations of the maximum clique problem
Continuous characterizations of the maximum clique problem
1997,
Given a graph G whose adjacency matrix is A , the Motzkin–Strauss formulation of...
A generalization of the perfect graph theorem under the disjunctive index
A generalization of the perfect graph theorem under the disjunctive index
2002,
In this paper, we relate antiblocker duality between polyhedra, graph theory, and the...
A note on clique-web facets for multicut polytopes
A note on clique-web facets for multicut polytopes
2002,
In this note we provide a previously undiscovered necessary condition for the...
A fixed-point approach to stable matchings and some applications
A fixed-point approach to stable matchings and some applications
2003,
We describe a fixed-point based approach to the theory of bipartite stable matchings....
Estimation methods for delays in non-regenerative discrete-event systems
Estimation methods for delays in non-regenerative discrete-event systems
2003,
Many long-run delay characteristics of computer, communication, manufacturing, and...
On block skip free transition matrices and first passage times
On block skip free transition matrices and first passage times
2003,
Starting from an abstract setting which extends the property ‘skip free to the...
A fixed point approach to the classification of Markov chains with a tree structure
A fixed point approach to the classification of Markov chains with a tree structure
2003,
In this paper, we study the classsification problem of discrete time and continuous...
β-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...
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...
Perturbed Markov processes
Perturbed Markov processes
2003,
A Markov process in discrete time is perturbed by a small parameter. A perturbation...
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...
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...
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...
On some waiting time problems
On some waiting time problems
2000,
A unifying technology is introduced for finding explicit closed form expressions for...
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...
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, ...},...
A near-optimal solution to a two-dimensional cutting stock problem
A near-optimal solution to a two-dimensional cutting stock problem
2000,
We present an asymptotic fully polynomial approximation scheme for strip-packing, or...
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...
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...
The computation of a continuum of constrained equilbria
The computation of a continuum of constrained equilbria
1996,
The equilibria of a model of an exchange economy with price rigidities are called...
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...
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...
Papers per page: