Recent scaling up of POMDP solvers towards realistic applications is largely due to point-based methods which quickly provide approximate solutions for medium-sized problems. New multi-core machines offer an opportunity to scale up to much larger domains. These machines support parallel execution and can speed up existing algorithms considerably. In this paper we suggest several ways in which p...

Proving the existence of a solution to a system of real equations is a central issue in numerical analysis. In many situations, the system of equations depend on parameters which are not exactly known. It is then natural to aim proving the existence of a solution for all values of these parameters in some given domains. This is the aim of the parametrization of existence tests. A new parametric...

We investigate techniques for automatically generating symbolic approximations to the time solution of a system of differential equations. This is an important primitive operation for the safety analysis of continuous and hybrid systems. In this paper we design a time elapse operator that computes a symbolic over-approximation of time solutions to a continous system starting from a given inital...

We propose a class of regularized Hermitian and skew-Hermitian splitting methods for the solution of large, sparse linear systems in saddle-point form. These methods can be used as stationary iterative solvers or as preconditioners for Krylov subspace methods. We establish unconditional convergence of the stationary iterations and we examine the spectral properties of the corresponding precondi...

We present a memory-bounded approximate algorithm for solving infinite-horizon decentralized partially observable Markov decision processes (DEC-POMDPs). In particular, we improve upon the bounded policy iteration (BPI) approach, which searches for a locally optimal stochastic finite state controller, by accompanying reachability analysis on controller nodes. As a result, the algorithm has diff...

Since its founding in 1925 as the patenting and licensing organization for the University of WisconsinMadison, WARF has been working with business and industry to transform university research into products that benefit society. WARF intellectual property managers and licensing staff members are leaders in the field of university-based technology transfer. They are familiar with the intricacies...

The main purpose of this paper is to study an iteration procedure for finding a common fixed point of a countable family of nonexpansive mappings in Banach spaces. We introduce a Mann type iteration procedure. Then we prove that such a sequence converges weakly to a common fixed point of a countable family of nonexpansive mappings. Moreover, we apply our result to the problem of finding a commo...

in this paper, we obtained the convergence of modified noor iterative scheme for nearly lipschitzian maps in real banach spaces. our results contribute to the literature in this area of re- search.

The (in)equational properties of the least fixed point operation on ( -)continuous functions on ( -)complete partially ordered sets are captured by the axioms of (ordered) iteration algebras, or iteration theories. We show that the inequational laws of the sum operation in conjunction with the least fixed point operation in continuous additive algebras have a finite axiomatization over the ineq...