Affine iterations of the form x n+1 =Ax n +b converge, using real arithmetic, if spectral radius matrix A is less than 1. However, substituting interval arithmetic to may lead divergence these iterations, in particular absolute value greater We will review different approaches limit overestimation iterates, when components initial vector x(0) and b are intervals. compare, both theoretically exp...

Iterative synthesis can generalize, automate and democratize the molecule-making process. Now, by using a computer algorithm to scan depths of chemical reactivity space, thousands iterative ways make small molecules are discovered.

This paper deals with computational algorithms for obtaining the optimal stationary policy and the minimum cost of a discounted semi-Markov decision process. Van Nunen [23) has proposed a modified policy iteration algorithm with a suboptimality test of MacQueen type, where the modified policy iteration algorithm is policy iteration method with the policy evaluation routine by a finite number of...

We consider asynchronous, parallel iterations for calculating enclosures of solutions of systems of nonlinear equations in IR n. Particularly, we will show how two classical theorems on the monotone convergence of some iterative methods for certain classes of nonlinear equations carry over to the asynchronous case.

In this paper we consider the problem of transmitting packets over a point to point wireless link where the objective is to minimize the average transmitted power subject to a constraint on the average packet delay and drop rate. We propose an online algorithm based on a novel post-decision state based framework and two timescale stochastic approximation technique. We argue that the algorithm i...

Howard’s policy iteration algorithm is one of the most widely used algorithms for finding optimal policies for controlling Markov Decision Processes (MDPs). When applied to weighted directed graphs, which may be viewed as Deterministic MDPs (DMDPs), Howard’s algorithm can be used to find Minimum Mean-Cost cycles (MMCC). Experimental studies suggest that Howard’s algorithm works extremely well i...

Policy iterations have been known in static analysis since a small decade. Despite the impressive results they provide – achieving a precise fixpoint without the need of widening/narrowing mechanisms of abstract interpretation – their use is not yet widespread. Furthermore, there are basically two dual approaches: min-policies and max-policies, but they have not yet been practically compared. M...