We propose empirical dynamic programming algorithms for Markov decision processes (MDPs). In these algorithms, the exact expectation in the Bellman operator in classical value iteration is replaced by an empirical estimate to get ‘empirical value iteration’ (EVI). Policy evaluation and policy improvement in classical policy iteration are also replaced by simulation to get ‘empirical policy iter...

The paper deals with the problem of automatic speaker change detection. A metric-based algorithm, called MDISTBIC, which means Modified DISTBIC, is proposed in this paper. The algorithm originates from the DISTBIC algorithm and modifies it in order to reach a higher efficiency. Both the DISTBIC and the MDISTBIC methods are tested in a number of experiments. As the results show, the MDISTBIC alg...

In this paper, we propose an algorithm base on decomposition technique for solvingthe mixed integer linear multiplicative-linear bilevel problems. In actuality, this al-gorithm is an application of the algorithm given by G. K. Saharidis et al for casethat the rst level objective function is linear multiplicative. We use properties ofquasi-concave of bilevel programming problems and decompose th...

This paper reviews some of quantum computation basics: qubit definition, quantum operations, quantum algorithms, measurement and quantum walk, and then applies the discrete quantum hypercube walk to the nonlinear systems over Galois Finite Field GF (2). The modified quantum walk algorithm needs O( mn 2 ) iteration, while the best classical general solution takes O( nm 2 ) iteration. The paper a...

We consider partially asynchronous parallel iteration of a fixed nonnegative matrix with stationary ergodic interprocessor communication delays. We study the iteration via a random graph describing the interprocessor influences. Our major result is an invariant description of the rates of convergence of arbitrary sequences of individual processor-time values. In the course of proving this resul...

To solve the global path planning problem of ship in static and dynamic environment, we propose an improved ant colony algorithm to plan ship’s navigation path. We use artificial potential field method compute force direction at initial iteration stage. The attraction function is modified improve efficiency hybrid algorithm. design pseudo-random state transition rule convergence by strengthenin...

We investigate effectiveness of an acceleration method applied to the modified Picard iteration for simulations of variably saturated flow. We solve nonlinear systems using both unaccelerated and accelerated modified Picard iteration as well as Newton’s method. Since Picard iterations can be slow to converge, the advantage of acceleration is to provide faster convergence while maintaining advan...

Using a high performance computer cluster, we run simulations regarding an open problem about d -dimensional critical branching random walks in a random IID environment The environment is given by the rule that at every site independently, with probability p 2 Œ0; 1 , there is a cookie, completely suppressing the branching of any particle located there. The simulations suggest self averaging: t...

The survey propagation (SP) algorithm has been shown to work well on large instances of the random 3-SAT problem near its phase transition. It was shown that SP estimates marginals over covers that represent clusters of solutions. The SP-y algorithm generalizes SP to work on the maximum satisfiability (Max-SAT) problem, but the cover interpretation of SP does not generalize to SP-y. In this pap...