Country: United States

Found 17049 papers in total
Analysis of sample-path optimization
Analysis of sample-path optimization
1996,
Sample-path optimization is a method for optimizing limit functions occurring in...
A weak-to-strong convergence principle for Fejer-monotone methods in Hilbert spaces
A weak-to-strong convergence principle for Fejer-monotone methods in Hilbert spaces
2001,
We consider a wide class of iterative methods arising in numerical mathematics and...
Second-order necessary conditions for the infinite-horizon variational problems
Second-order necessary conditions for the infinite-horizon variational problems
1996,
We give new proofs of first-order and second-order necessary conditions for the...
Homeomorphism conditions for coherently oriented piecewise affine mappings
Homeomorphism conditions for coherently oriented piecewise affine mappings
1996,
This article is mainly concerned with the homeomorphism problem for piecewise affine...
Approximation algorithms for lawn mowing and milling
Approximation algorithms for lawn mowing and milling
2000,
We study the problem of finding shortest tours/paths for ‘lawn mowing’ and...
A faster combinatorial algorithm for the generalized circulation problem
A faster combinatorial algorithm for the generalized circulation problem
1996,
This paper presents a modified version of Algorithm MCF proposed by Goldberg, Plotkin...
A differential calculus for random matrices with applications to (max, plus)-linear stochastic systems
A differential calculus for random matrices with applications to (max, plus)-linear stochastic systems
2001,
We introduce the concept of weak differentiability for random matrices and thereby...
Derivatives of spectral functions
Derivatives of spectral functions
1996,
A special function of a Hermitian matrix X is a function which depends only on the...
The degree of an exact order matrix
The degree of an exact order matrix
1996,
The classes of exact order k matrices for any positive integer k, were defined and...
On Latouche–Ramaswami's logarithmic reduction algorithm for quasi-birth-and-death processes
On Latouche–Ramaswami's logarithmic reduction algorithm for quasi-birth-and-death processes
2002,
We consider Latouche–Ramaswami's logarithmic reduction algorithm for solving...
A single channel on/off model with transmission control protocol-like control
A single channel on/off model with transmission control protocol-like control
2002,
We model behavior of a TCP-like source transmitting over a single channel to a server...
High-order extensions of the double chain Markov model
High-order extensions of the double chain Markov model
2002,
The Double Chain Markov Model is a fully Markovian model for the representation of...
Discounted stochastic fluid programs
Discounted stochastic fluid programs
2001,
We consider optimal control problems for stochastic fluid models of the following...
Computing densities for Markov chains via simulation
Computing densities for Markov chains via simulation
2001,
We introduce a new class of density estimators, termed look-ahead density estimators,...
Nonhomogeneous Markov decision processes with Borel state space – The average criterion with nonuniformly bounded rewards
Nonhomogeneous Markov decision processes with Borel state space – The average criterion with nonuniformly bounded rewards
2000,
This paper deals with nonhomogeneous Markov decision processes with Borel state space...
Probability bounds with cherry trees
Probability bounds with cherry trees
2001,
A third order upper bound is represented on the probability of the union of a finite...
Lipschitzian multifunctions and a Lipschitzian inverse mapping theorem
Lipschitzian multifunctions and a Lipschitzian inverse mapping theorem
2001,
We introduce a new class of multifunctions whose graphs under certain ‘kernel...
Almost perfect matrices and graphs
Almost perfect matrices and graphs
2001,
We introduce the notions of ω-projection and κ-projection that map almost...
Calculating K-connectedness reliability using Steiner bounds
Calculating K-connectedness reliability using Steiner bounds
1996,
The K -connectedness reliability problem considered in this paper has as input...
Learning sets in state dependent signalling game forms: A characterization
Learning sets in state dependent signalling game forms: A characterization
2001,
We consider repeated game forms with incomplete information and state dependent...
An exact bound on epsilon for nonemptiness of epsilon cores of games
An exact bound on epsilon for nonemptiness of epsilon cores of games
2001,
We consider collections of games with and without side payments described by certain...
Correlated equilibrium in quitting games
Correlated equilibrium in quitting games
2001,
A quitting game is a sequential game where each player has two actions: to continue or...
Absorbing games with a signalling structure
Absorbing games with a signalling structure
2001,
We consider a subclass of two-person zero-sum undiscounted stochastic games called...
Quitting games
Quitting games
2001,
Quitting games are n -player sequential games in which, at any stage, each player has...
Papers per page: