نتایج جستجو برای: redundancy optimization
تعداد نتایج: 341516 فیلتر نتایج به سال:
In this paper we develop a search procedure for redundancy optimization of reliability models. We consider those systems where the reliability cannot be evaluated exactly but must be estimated through Monte Carlo simulation. At each iteration, two neighboring configurations are compared and the one that appears to be better is passed on to the next iteration. The search procedure uses an incre...
in this paper, we study different methods of solving joint redundancy-availability optimization for series-parallel systems with multi-state components. we analyzed various effective factors on system availability in order to determine the optimum number and version of components in each sub-system and consider the effects of improving failure rates of each component in each sub-system and impr...
Multi-threaded programs have many applications which are widely used such as operating systems. Analyzing multi-threaded programs differs from sequential ones; the main feature is that many threads execute at the same time. The effect of all other running threads must be taken in account. Partial redundancy elimination is among the most powerful compiler optimizations: it performs loop-invarian...
Filter selection techniques are known for their simplicity and efficiency. However this kind of methods doesn’t take into consideration the features inter-redundancy. Consequently the un-removed redundant features remain in the final classification model, giving lower generalization performance. In this paper we propose to use a mathematical optimization method that reduces inter-features redun...
In this paper, the problem of coordinated motion control of a nonholonomic mobile platform with a serial manipulator mounted on top of the platform is addressed. The redundancy resolution algorithm bases on a constraint optimization approach, where the non–holonomic behaviour of the platform is modeled into inequality constraints leading to a convex optimization problem.
there are many approaches for solving variety combinatorial optimization problems (np-compelete) that devided to exact solutions and approximate solutions. exact methods can only be used for very small size instances due to their expontional search space. for real-world problems, we have to employ approximate methods such as evolutionary algorithms (eas) that find a near-optimal solution in a r...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید