نتایج جستجو برای: simultaneous iterative algorithm

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

2012
Emmanuelle Vin

Actually, lean manufacturing is a must to improve productivity and reduce cost. One of the tools of lean is cellular manufacturing. This technique subdivides the factory to several small entities, which are easier to manage. The algorithm proposed in this paper is based on the simultaneous resolution of two interdependent problems. These two problems emerge when the notion of flexibility is int...

Journal: :International Journal of Biomedical Imaging 2006
Vincent Israel-Jost Philippe Choquet André Constantinesco

The use of iterative algorithms in tomographic reconstruction always leads to a frequency adapted rate of convergence in that low frequencies are accurately reconstructed after a few iterations, while high frequencies sometimes require many more computations. In this paper, we propose to build frequency adapted (FA) algorithms based on a condition of incomplete backprojection and propose an FA ...

2014
Jixin Lv Yukinori Kobayashi Ankit A. Ravankar Takanori Emaru

Thispaper presents a method of simultaneous localization and mapping (SLAM) in indoor environment using extended Kalman filter (EKF) with the straight line segments as the adopted geometrical feature. By using conventional two dimensional laser range finder (LRF) as the main sensor, robot finds a number of points scanned from the surrounding environment.Split-and-Merge is one of the mostpopular...

.S Ebrahimi HR Sahebi

We suggest a explicit viscosity iterative algorithm for nding a common elementof the set of common xed points for W-mappings which solves somevariational inequality. Also, we prove a strong convergence theorem with somecontrol conditions. Finally, we apply our results to solve the equilibrium problems.Finally, examples and numerical results are also given.

Journal: :Mathematics 2023

A simultaneous reconstruction of the initial condition and space-dependent reaction coefficient in a multidimensional hyperbolic partial differential equation with interior degeneracy is concern. temporal integral observation utilized to achieve that purpose. The well-posedness, existence, uniqueness inverse problem under consideration are discussed. can be reformulated as least squares minimiz...

ژورنال: پژوهش های ریاضی 2022

The mann fixed point algorithm play an importmant role in the approximation of fixed points of nonexpansive operators. In this paper, by considering new conditions, we prove the weak convergence of mann fixed point algorithm, for finding a common fixed point of two nonexpansive mappings in real Hilbert spaces. This results extend the privious results given by Kanzow and Shehu. Finally, we give ...

2003
Charles Byrne

Let T be a (possibly nonlinear) continuous operator on Hilbert space H. If, for some starting vector x , the orbit sequence {T k x, k = 0, 1, . . .} converges, then the limit z is a fixed point of T ; that is, T z = z. An operator N on a Hilbert space H is nonexpansive (ne) if, for each x and y in H, ‖Nx − Ny‖ ‖x − y‖. Even when N has fixed points the orbit sequence {Nk x} need not converge; co...

2008
Miguel Andres Figliozzi

The joint solution of routing problems with soft and hard time windows has valuable practical applications. Simultaneous solution approaches to both types of problems are needed when: (a) the number of routes needed for hard time windows exceeds the number of available vehicles, (b) a study of cost-service tradeoffs is required or the dispatcher has qualitative information regarding the relativ...

Journal: :journal of industrial engineering and management studies 0
m. sayyah department of mathematics, parand branch, islamic azad university, parand, iran. h. larki department of mathematics, shahid chamran university of ahvaz, iran. m. yousefikhoshbakht young researchers & elite club, hamedan branch, islamic azad university, hamedan, iran.

one of the most important extensions of the capacitated vehicle routing problem (cvrp) is the vehicle routing problem with simultaneous pickup and delivery (vrpspd) where customers require simultaneous delivery and pick-up service. in this paper, we propose an effective ant colony optimization (eaco) which includes insert, swap and 2-opt moves for solving vrpspd that is different with common an...

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

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