نتایج جستجو برای: iterative dynamic programming
تعداد نتایج: 752805 فیلتر نتایج به سال:
the dynamic facility layout problem (dflp) is the problem of finding positions of departments onthe plant floor for multiple periods (material flows between departments change during the planning horizon)such that departments do not overlap, and the sum of the material handling and rearrangement costs isminimized. in this paper a new optimization algorithm inspired from colonizing weeds, invasi...
در این پایان نامه، بر اساس نیاز روز صنعت هوافضا، دو روش جهت طراحی دسته ای از قوانین هدایت که هدایت ترمینال نامند، تدوین و طراحی شده است. این دو روش، بر اساس شاخصه های یک هدایت ترمینال، به شکل پسخورد متغیر های حالت بوده و در طراحی آن از روش های عددی بهره گرفته شده است. از میان روش های عددی موجود، روش برنامه ریزی دینامیکی تقریبی (approximate dynamic programming) که کمتر در علوم هوافضا مورد توجه ب...
Abstract Distributed constraint optimization problems (DCOPs) have been studied as a fundamental framework of cooperative problem solving in multiagent systems. Exact solvers based on tree search and dynamic programming have been proposed for DCOPs. Based on tree searches, the solvers perform iterative processing that depends on message communication. Therefore the overhead of the communication...
By using the iterative technique and Nadler’s theorem, we construct a new iterative algorithm for solving a system of nonlinear inclusions in Banach spaces. We prove some new existence results of solutions for the system of nonlinear inclusions and discuss the convergence of the sequences generated by the algorithm. As an application, we show the existence of solution for a system of functional...
This paper addresses the problem of detecting keywords in unconstrained speech without explicit modeling of nonkeyword segments. The proposed algorithm is based on recent developments in confidence measures using local posterior probabilities, and searches for the segment maximizing the average observation posterior’ along the most likely path in the hypothesized keyword model.’ As known, this ...
In this paper, we consider a novel Bayesian approach to 2-D phase unwrapping. The phase is unwrapped according to a maximum a posteriori (MAP) rule, where the estimate is made through a form of 2-D dynamic programming. The approach uses structured iterated conditional modes to achieve good performance without examining a large number of states in the dynamic system. We analyze the performance o...
we study the problem of reconstructing binary images from four projections data in a fuzzy environment. given the uncertainly projections,w e want to find a binary image that respects as best as possible these projections. we provide an iterative algorithm based on fuzzy integer programming and linear membership functions.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید