نتایج جستجو برای: sided forward and backward operators

تعداد نتایج: 16863009  

Journal: :journal of advances in computer research 0

in this paper, a new method is introduced for improving the efficiency of the residue number system, which uses both binary and residue representations in order to represent a number. a residue number system uses the remainder of the division in several different modules. conversion of a number to smaller ones and carrying out parallel calculations on these numbers greatly increase the speed of...

Journal: :amirkabir international journal of modeling, identification, simulation & control 2015
s. rahimi damirchi-darasi m.h. fazel zarandi m. izadi

one-third of the people with an age over twenty have some signs of degenerated discs. however, in most of the patients the mere presence of degenerative discs is not a problem leading to pain, neurological compression, or other symptoms. this paper presents an interval type-2 fuzzy hybrid rule-based system to diagnose the abnormal degenerated discs where pain variables are represented by interv...

Journal: :SIAM J. Imaging Sciences 2013
Hugo Raguet Mohamed-Jalal Fadili Gabriel Peyré

This paper introduces a generalized forward-backward splitting algorithm for finding a zero of a sum of maximal monotone operators B + ∑n i=1 Ai, where B is cocoercive. It involves the computation of B in an explicit (forward) step and of the parallel computation of the resolvents of the Ai’s in a subsequent implicit (backward) step. We prove its convergence in infinite dimension, and robustnes...

2014
Patrick L. Combettes Isao Yamada

Properties of compositions and convex combinations of averaged nonexpansive operators are investigated and applied to the design of new fixed point algorithms in Hilbert spaces. An extended version of the forward-backward splitting algorithm for finding a zero of the sum of two monotone operators is obtained.

2009
Christophe Joubert

– Instead of defining both Ctl formulas and least fixed point computation algorithms, program slicing can be described as a μ-calculus formula [11] only. This greatly simplifies the definition of existing classes of program slicing (backward/forward/chopping, static/dynamic/hybrid/conditioned, syntaxpreserving/amorphous) in a unified and concise framework. Due to its capability of defining both...

Journal: :Information and Computation 1995

Journal: :International Journal of Gynecology & Obstetrics 2010

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید