This chapter deals with total reward criteria. We discuss the existence and structure of optimal and nearly optimal policies and the convergence of value iteration algorithms under the so-called General Convergence Condition. This condition assumes that, for any initial state and for any policy, the expected sum of positive parts of rewards is nite. Positive, negative, and discounted dynamic pr...

introduction: family physician plan in iran was conducted to establish service referral system. its urban step began in 2012 and it was supposed that the effectiveness is enhanced and the costs are reduced. the implementation of this program has faced some challenges, especially in human resources management. the aim of this study was to optimally allocate human resources for urban family physi...

K e y w o r d s C o m p l e x polynomial zeros, Approximation, Polynomial factorization, Parallel algorithms, Computational complexity, Sequential algorithms. 1. I N T R O D U C T I O N 1.1. T h e Subject , Some History, and a S u m m a r y of Our Resul ts The problem of solving a polynomial equation p ( x ) = 0 substantially motivated the development of mathematics throughout the centuries. As...

We consider the problem of efficiently reconciling two similar sets held by different hosts while minimizing the communication complexity, which we call the set reconciliation problem. We describe an approach to set reconciliation based on a polynomial encoding of sets. The resulting protocols exhibit tractable computational complexity and nearly optimal communication complexity when the sets b...

We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision the probability that a query point lies within this polygon. The goal is to compute a search structure to determine which cell of the subdivision contains a given query point, so as to minimize the expected search time....

Statistical coding techniques have been used for a long time in lossless data compression, using methods such as Hu man's algorithm, arithmetic coding, Shannon's method, Fano's method, etc. Most of these methods can be implemented either statically or adaptively. In this paper, we show that although Fano coding is suboptimal, it is possible to generate static Fano-based encoding schemes which a...

We consider the problem of computing a k-sparse approximation to the discrete Fourier transform of an n-dimensional signal. Our main result is a randomized algorithm that computes such an approximation using O(k log n(log log n)) signal samples in time O(k log n(log log n)), assuming that the entries of the signal are polynomially bounded. The sampling complexity improves over the recent bound ...

We show two sets of results applying the theory of extractors to resource-bounded Kolmogorov complexity: Most strings in easy sets have nearly optimal polynomial-time CD complexity. This extends work of Sipser Sip83] and Buhrman and Fortnow BF97]. We use extractors to extract the randomness of strings. In particular we show how to get from an arbitrary string, an incompressible string which enc...