نتایج جستجو برای: dynamic sleepwake up algorithm
تعداد نتایج: 1948834 فیلتر نتایج به سال:
Nowadays, we are witnessing the growth of firms that distribute the production capacity of their products to a wide geographic range to supply the demand of several markets. In this article, the relationships and interactions between cell design and supply chain design are investigated. For this purpose, a novel integrated model is presented for designing dynamic cellular manufacturing systems ...
Damage detection has been focused by researchers because of its importance in engineering practices. Therefore, different approaches have been presented to detect damage location in structures. However, the higher the accuracy of methods is required the more complex deliberations. Based on the conventional studies, it was observed that the damage locations and its size are associated with dynam...
A Framework for Adapting Population-Based and Heuristic Algorithms for Dynamic Optimization Problems
In this paper, a general framework was presented to boost heuristic optimization algorithms based on swarm intelligence from static to dynamic environments. Regarding the problems of dynamic optimization as opposed to static environments, evaluation function or constraints change in the time and hence place of optimization. The subject matter of the framework is based on the variability of the ...
background: in radiation therapy, the peripheral dose is important when anatomical structures with very low dose tolerances are involved. in this study, the two available calculation algorithms of the varian eclipse 8.6 treatment planning system(tps), the anisotropic analytic algorithm (aaa) and pencil-beam convolution (pbc) was used to compare measured and calculated peripheral dose distributi...
An important problem in nonlinear science is the unknown parameters estimation in Loranz chaotic system. Clearly, the parameter estimation for chaotic systems is a multidimensional continuous optimization problem, where the optimization goal is to minimize mean squared errors (MSEs) between real and estimated responses for a number of given samples. The Bees algorithm (BA) is a new member of me...
This paper deals with the formal derivation of an eecient tabulation algorithm for table-driven bottom-up tree acceptors. Bottom-up tree acceptors are based on a notion of match sets. First we derive a naive acceptance algorithm using dynamic computation of match sets. Tabulation of match sets leads to an eecient acceptance algorithm, but tables may be so large that they can not be generated du...
Incremental data mining algorithms process frequent updates to dynamic datasets efficiently by avoiding redundant computation. Existing incremental extension to shared nearest neighbor density based clustering (SNND) algorithm cannot handle deletions to dataset and handles insertions only one point at a time. We present an incremental algorithm to overcome both these bottlenecks by efficiently ...
Dynamic topic models (DTMs) are very effective in discovering topics and capturing their evolution trends in time series data. To do posterior inference of DTMs, existing methods are all batch algorithms that scan the full dataset before each update of the model and make inexact variational approximations with mean-field assumptions. Due to a lack of a more scalable inference algorithm, despite...
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید