نتایج جستجو برای: decomposition algorithm

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

2011
Thap Panitanarak Suzanne M. Shontz

Domain decomposition methods are commonly employed within the context of parallel numerical algorithms. Most often, the domain decomposition is performed before the main computation begins. Within the context of mesh generation, parallel mesh generation is desired when the goal is to mesh a very large geometric domain or if very high accuracy is required. In this paper, we propose a novel techn...

Journal: :Journal of Algorithms & Computational Technology 2009

Journal: :Information Sciences 2021

Most of the existing dynamic multi-objective evolutionary algorithms (DMOEAs) are effective, which focuses on searching for approximation Pareto-optimal front (POF) with well-distributed in handling optimization problems (DMOPs). Nevertheless, real-world scenarios, decision maker (DM) may be only interested a portion corresponding POF (i.e., region interest) different instances, rather than who...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه بوعلی سینا - دانشکده علوم پایه 1391

abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...

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

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