نتایج جستجو برای: accuracy in calculating optimal bin size
تعداد نتایج: 17123235 فیلتر نتایج به سال:
bin size is one of the fundamental and key parameters in 3d land seismic operation design and has an important role in the determination and calculation of other design parameters. therefore, optimization of this parameter is vital. in this study a new method for optimization of the bin size has been used. the optimization algorithm is linear and based on a mathematical model. due to the relati...
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...
the purpose of this study was to investigate the effect of task repetition on accuracy of iranian efl learners ’speaking ability. in order to achieve this purpose, a null hypothesis was developed: there is no statistically significant difference between accuracy speaking ability in iranian efl learners by use of task repetition. ; of course i should mention that, beside this null hypothesis, an...
in reality, most structures involved in geotechnical engineering are three dimensional in nature, and although in many, plane strain or axisymmetric approximations are reasonable, there are some, for which 3-d treatment is required. the quantity of data, and the size of the various vectors and matrices involved in such analysis, increase dramatically. this has sever implications for computer r...
The time histogram method is the most basic tool for capturing a time dependent rate of neuronal spikes. Generally in the neurophysiological literature, the bin size that critically determines the goodness of the fit of the time histogram to the underlying spike rate has been subjectively selected by individual researchers. Here, we propose a method for objectively selecting the bin size from t...
We study a variety of NP-hard bin packing problems under a divisibility constraint that generalizes the often encountered situation in which all item sizes are powers of 2. For ordinary one-dimensional bin packing, we show that First Fit Decreasing produces optimal packings under this restriction, and that if in addition the largest item size divides the bin capacity, then even the less powerfu...
For NP-complete problems, it may not be possible to find an optimal solution in polynomial time. However, efficient approximation algorithms for many NP-complete problems do exist. A good approach is to find tighter upper and lower bounds on the optimal solutions. As the gap between these two bounds approaches zero, optimality is reached. For minimization problems, any feasible solution serves ...
the present study was conducted to investigate the effect of implicit focus on form through input flooding and the effect of noticing, explicit focus on form on linguistic accuracy. to fulfill the purpose of the study, 86 iranian pre-intermediate efl learners of one of the language institutes were chosen by means of administering ket as the homogeneity test. these learners were pretested throug...
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...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید