Results 1 
3 of
3
Controlled arkov chains with constraints
"... Abstract. We consider the ergodic control of a Markov chain on a countable state space with a compact action space in presence of finitely many (say, m) ergodic constraints. Under a condition on the cost functions that penalizes instability, the existence of an optimal stable stationary strategy ran ..."
Abstract
 Add to MetaCart
Abstract. We consider the ergodic control of a Markov chain on a countable state space with a compact action space in presence of finitely many (say, m) ergodic constraints. Under a condition on the cost functions that penalizes instability, the existence of an optimal stable stationary strategy
e Optimal Error Ex arkov Order Esti
"... Abstruct We consider the problem of estimating the order of a stationary ergodic Markov chain. Our focus is on estimators which satisfy a generalized NeymanPearson criterion of optimality. Specifically, the optimal estimator minimizes the probability of underestimation among all estimators with p ..."
Abstract
 Add to MetaCart
Abstruct We consider the problem of estimating the order of a stationary ergodic Markov chain. Our focus is on estimators which satisfy a generalized NeymanPearson criterion of optimality. Specifically, the optimal estimator minimizes the probability of underestimation among all estimators
The Bit Vector Intersection Problem
, 1995
"... This paper introduces the bit vector intersection problem: given a large collection of sparse bit vectors, find all the pairs with at least t ones in common for a given input parameter t. The assumption is that the number of ones common to any two vectors is significantly less than t, except for an ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
on a recursive treesearching procedure, and the other on hashing. We analyze the tree scheme in terms of branching processes, while our analysis of the hashing scheme is based on M,arkov chains. Since both algorithms have similar asymptotic performance, we also examine experimentally their relative