نتایج جستجو برای: modified neighbor on path mnop
تعداد نتایج: 8579138 فیلتر نتایج به سال:
The evolution of DNA sequences can be described by discrete state continuous time Markov processes on a phylogenetic tree. We consider neighbor-dependent evolutionary models where the instantaneous rate of substitution at a site depends on the states of the neighboring sites. Neighbor-dependent substitution models are analytically intractable and must be analyzed using either approximate or sim...
Mobile Ad Hoc Networks (MANETs) consist of mobile nodes which are not controlled by any base station. Mobile nodes act as a major role because of performing the data transmission, route discovery, route maintenance. The packet loss occurs often while the nodes are moving out of range, or the node has not enough either path and link stability or neighbor node stability. In this paper we propose ...
By increasing, the complexity of chips and the need to integrating more components into a chip has made network –on- chip known as an important infrastructure for network communications on the system, and is a good alternative to traditional ways and using the bus. By increasing the density of chips, the possibility of failure in the chip network increases and providing correction and fault tol...
A parallel version of a fast algorithm for singular integral transforms [6] is presented. The parallel version only utilizes a linear neighborto-neighbor communication path which makes the algorithm very scalable and suitable for any distributed memory architecture.
یکی از مهم ترین معایب فیلتر های n مسیره تازدگی هارمونیکی (hfb) می باشد. یعنی بعضی از هارمونیک های فرکانس سوئیچینگ (fs) می توانند با تبدیل فرکانسی ، مولفه هایی را در باند عبور فیلتر ایجاد کنند. در این پایان نامه روشی سیستماتیک ارائه شده است تا بدون افزایش فرکانس کلاک مرجع ورودی (clkin)، مشکل تازدگی هارمونیکی فیلترهای n مسیره کاهش یابد. برای دستیابی به این هدف، ابتدا تازدگی هارمونیکی در یک فیلتر ...
There are many path planning algorithms designed for mobile robots with software implementation. In the case of dynamic environments high-speed planning and recomputation of paths is necessary to avoid collision of robots with moving objects. A hardware-efficient algorithm is presented for finding a path of a mobile robot on image of an environment captured by an overhead camera. The algorithm ...
We have modified the conventional cell-linked list method to reduce the number of unnecessary internuclear distance calculations in molecular simulations of systems containing many particles. In the conventional method, the simulation space is partitioned into cells with edge lengths no less than the cutoff distance of the interaction potential (rcut). The atoms are assigned to cells according ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید