«approximate dynamic analysis»

۱۷٬۵۵۵ نتیجه
  • Swarm-based approximate dynamic optimization process for discrete particle swarm optimization system

    سند علمی۲۰۰۹IJBICQi Kang, Lei Wang, Qidi Wu

    This paper presents a convergence analysis of particle swarm optimization system by treating it as a discrete-time linear time-variant system firstly. And then, based on the results of system convergence conditions, dynamic optimal control of a deterministic PSO system for parame

  • Approximate Dynamic Programming for Two-Player Zero-Sum Markov Games

    سند علمی۲۰۱۵ICMLJulien Pérolat, Bruno Scherrer, Bilal Piot, Olivier Pietquin

    This paper provides an analysis of error propagation in Approximate Dynamic Programming applied to zero-sum two-player Stochastic Games. We provide a novel and unified error propagation analysis in Lp-norm of three well-known algorithms adapted to Stochastic Games (namely Approxi

  • An integrated approach to dynamic analysis of railroad track transitions behavior

    سند علمی۲۰۱۴Debakanta Mishra, Yu Qian, Hai Huang

    Railway transitions like bridge approaches experience differential vertical movements due to variations in track stiffness, track damping characteristics, ballast settlement from fouling and/or degradation, as well as fill and subgrade settlement. Proper understanding of this phe

  • Low-discrepancy sampling for approximate dynamic programming with local approximators

    سند علمی۲۰۱۴Computers & ORCristiano Cervellera, Mauro Gaggero, Danilo Macciò

    Approximate dynamic programming (ADP) relies, in the continuous-state case, on both a flexible class of models for the approximation of the value functions and a smart sampling of the state space for the numerical solution of the recursive Bellman equations. In this paper, low-di

  • SAM: Self-adaptive Dynamic Analysis for Multithreaded Programs

    سند علمی۲۰۱۱Haifa Verification ConferenceQichang Chen, Liqiang Wang, Zijiang Yang

    Many dynamic analysis techniques have been proposed to detect incorrect program behaviors resulted from faulty code. However, the huge overhead incurred by such dynamic analysis prevents thorough testing of large-scale software systems. In this paper, we propose a novel framework

  • Approximate dynamic programming for management of high-value spare parts

    سند علمی۲۰۰۸Hugo Simao, Warren Powell

    Purpose – An aircraft manufacturer faces the problem of allocating inventory to a set of distributed warehouses in response to random, nonstationary demands. There is particular interest in managing high value, low volume spare parts which must be available to respond to low-freq

  • Proper orthogonal decomposition based optimal neurocontrol synthesis of a chemical reactor process using approximate dynamic programming

    سند علمی۲۰۰۳Neural networks : the official journal of the International Neural Network SocietyRadhakant Padhi, S. N. Balakrishnan

    The concept of approximate dynamic programming and adaptive critic neural network based optimal controller is extended in this study to include systems governed by partial differential equations. An optimal controller is synthesized for a dispersion type tubular chemical reactor,

  • An Approximate Dynamic Programming Approach for a Product Distribution Problem

    سند علمی۲۰۰۴

    This paper proposes an approximate dynamic programming-based method for optimizing the distribution operations of a company manufacturing a certain product in numerous plants and distributing it to different regional markets for sale. The production at each plant and in each time

  • A Self-organizing Recurrent Neural Network Based on Dynamic Analysis

    سند علمی۲۰۱۷Qili Chen, Junfei Qiao, Yi Ming Zou

    A recurrent neural network with a self-organizing structure based on the dynamic analysis of a task is presented in this paper. The stability of the recurrent neural network is guaranteed by design. A dynamic analysis method to sequence the subsystems of the recurrent neural netw

  • An approximate dynamic programming framework for modeling global climate policy under decision-dependent uncertainty

    سند علمی۲۰۱۲Comput. Manag. ScienceMort Webster, Nidhi Santen, Panos Parpas

    Analyses of global climate policy as a sequential decision under uncertainty have been severely restricted by dimensionality and computational burdens. Therefore, they have limited the number of decision stages, discrete actions, or number and type of uncertainties considered. In