نتایج جستجو برای: random modified sp iteration
تعداد نتایج: 683930 فیلتر نتایج به سال:
In this paper, we consider an iteration process to approximate a common random fixed point of a finite family of asymptotically quasi-nonexpansive random mappings in convex metric spaces. Our results extend and improve several known results in recent literature.
The input motion for seismic analysis of building structures is generally specified in design codes in terms of response spectrum. Therefore, real or simulated time histories for ground motions whose response spectrum matches approximately the design spectrum is desired. Among the various techniques currently available for generating spectrum compatible time histories it is possible to distingu...
We present a stochastic planner based on Markov Decision Processes (MDPs) that participates to the probabilistic planning track of the 2006 International Planning Competition. The planner transforms the PPDDL problems into factored MDPs that are then solved with a structured modified value iteration algorithm based on the safest stochastic path computation from the initial states to the goal st...
This paper deals with a modification of the Hill cipher. In this, we have introduced interweaving in each step of the iteration. The interweaving of the resulting plaintext, at each stage of the iteration, and the multiplication with the key matrix leads to confusion and diffusion. From the cryptanalysis performed in this investigation, we have found that the cipher is a strong one.
THREE NEW SPECIES FROM JIANGXI, CHINA, ARE DESCRIBED AND ILLUSTRATED: Stenuswugongshanus sp. n., Stenusmingyueshanus sp. n., and Stenussongxiaobini sp. n. A previously published key to the Chinese species of the Stenuscirrus group is modified to accommodate the new species.
I. Reconstruction functions: Demonstration code: 1. xout=ADMM WT(S,b,param) Demo ADMM WT.m 2. xout=ADMM WT CT(S,b,param) Demo ADMM WT CT.m 3. xout=ADMM outer(S,b) Demo Multiscale ADMM WT CT.m. II. Sampling functions: Demonstration code: 1. S = Oracle Random Sampling( x0, sp ) Demo Oracle Random Sampling.m 2. S = Oracle Random Sampling with PCA( x0, sp, Spilot ) Demo Oracle Random Sampling with ...
Three new Brachinus species namely B. grootaerti n. sp. (Palawan Island), B. palawanensis n. sp. (Palawan Island), B. mindanaoensis n. sp. (Mindanao Island) from Philippines were described. In addition, a modified key to the known Brachinus Philippine species is provided.
In this article we first discuss the existence and uniqueness of a solution for the coincidence problem: Find p ∈ X such that Tp = Sp, where X is a nonempty set, Y is a complete metric space, and T,S :X → Y are two mappings satisfying a Wardowski type condition of contractivity. Later on, we will state the convergence of the Picard-Juncgk iteration process to the above coincidence problem as we...
We consider infinite-horizon γ-discounted Markov Decision Processes, for which it is known that there exists a stationary optimal policy. We consider the algorithm Value Iteration and the sequence of policies π1, . . . , πk it implicitely generates until some iteration k. We provide performance bounds for non-stationary policies involving the last m generated policies that reduce the state-of-t...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید