A MULTI-STEP IMPLICIT ITERATIVE PROCESS FOR COMMON FIXED POINTS OF GENERALIZED C-OPERATORS IN CONVEX METRIC SPACES Zahid Akhtar, Hafiz Fukhar-ud-din, Ali Ahmad and Muhammad Ibrahim 1 Department of Mathematics, The Islamia University of Bahawalpur, Bahawalpur, 63100, Pakistan. College of computer Science and information systems, Jazan University, Jazan, Saudi Arabia. Center for Advanced Studies ...

We formulate the problem of scheduling a single server in a multi-class queue-ing system as a Markov decision process under the discounted cost and the average cost criteria. We develop a new implementation of the modiied policy iteration (MPI) dynamic programming algorithm to eeciently solve problems with large state spaces and small action spaces. This implementation has an enhanced policy ev...

this paper presents a hybrid technique for simultaneous estimation of parameter and function in inverse heat conduction problems. no prior information is used for the functional form of the heat flux in the present study. the scheme presented here is a combination of two different classical methods: the variable metric method (vmm) and gauss method (gm). the determination of the unknown thermal...

Adaptive optimal control of nonlinear dynamic systems with deterministic and known dynamics under a known undiscounted infinite-horizon cost function is investigated. Policy iteration scheme initiated using a stabilizing initial control is analyzed in solving the problem. The convergence of the iterations and the optimality of the limit functions, which follows from the established uniqueness o...

This paper proposes a technique to specify and verify whether a loop can be parallelised. Our approach can be used as an additional step in a parallelising compiler to verify user annotations about loop dependences. Essentially, our technique requires each loop iteration to be specified with the locations it will read and write. From the loop iteration specifications, the loop (in)dependences c...

This paper presents a cooperative strategy between volumetric registration and segmentation. The segmentation method is based on the level set formalism. Starting from an initial position, a closed 3D surface propagates towards the desired boundaries through the evolution of a 4-D implicit function. We show that the number of iterations required for convergence is significantly reduced by using...

A large class of problems of sequential decision-making can be modeled as Markov or Semi-Markov Decision Problems, which can be solved by classical methods of dynamic programming. However, the computational complexity of the classical MDP algorithms, such as value iteration and policy iteration, is prohibitive and will grow intractably with the size of problems. Furthermore, they require for ea...

In this paper, a new inter-iteration filtering scheme based on diffusion Maximum a Posteriori (MAP) estimation for Positron emission tomography (PET) image reconstruction is proposed. This is achieved by gaining the insights into the classical MAP iteration (e.g. the 'one-step-late' algorithm, OSL) and the several well-established approximations to the diffusion process. We show that such a new...

We present an active-set method for minimizing an objective that is the sum of a convex quadratic and `1 regularization term. Unlike two-phase methods that combine a first-order active set identification step and a subspace phase consisting of a cycle of conjugate gradient iterations, the method presented here has the flexibility of computing one of three possible steps at each iteration: a rel...