نتایج جستجو برای: random path based direct encoding

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

2005
Emre Topak Sviatoslav Voloshynovskiy Oleksiy J. Koval Mehmet Kivanç Mihçak Thierry Pun

In digital media transfer, geometrical transformations desynchronize the communications between the encoder and the decoder. Therefore, an attempt to decode the message based on the direct output of the channel with random geometrical state fails. The main goal of this paper is to analyze the conditions of reliable communications based on structured codebooks in channels with geometrical transf...

Journal: :علوم گیاهان زراعی ایران 0
لیلا شافع دانش آموختۀ کارشناسی ارشد، بخش زراعت و اصلاح نباتات، دانشگاه شهید باهنر کرمان مهری صفاری دانشیار بخش زراعت و اصلاح نباتات، دانشگاه شهید باهنر کرمان

this research was conducted to evaluate the effect of different nitrogen and zinc combination on grain yield and its component in maize by path analysis. this experiment was carried out through split plot based on rcbd, varieties as main plot and fertilizers as sub plot, with three replication at badjgah (experimental farm of shiraz university). nitrogen fertilizer in (120,260 and 400 kg/ha) an...

Journal: :J. Artificial Societies and Social Simulation 2008
Marc R. H. Roedenbeck Barnas Nothnagel

When are we locked in a path? This is one of the main questions concerning path dependency. Coming from Arthur's model of increasing returns and technology adoption (Arthur 1989), this paper addresses the question of when and how a lock-in occurs. To gain a better understanding of the path process, different modifications are made. First, the random selection of two types of adopters is substit...

Mostafa E. Salehi Roham Shakiba,

In this paper we introduce an improvement in the path planning algorithm for the humanoid soccer playing robot which uses Ferguson splines and PSO (Particle Swarm Optimization). The objective of the algorithm is to find a path through other playing robots to the ball, which should be as short as possible and also safe enough. Ferguson splines create preliminary paths using random generated para...

Journal: :Inf. Process. Lett. 2011
Pierluigi Crescenzi Miriam Di Ianni Andrea Marino Donatella Merlini Gianluca Rossi Paola Vocca

In this paper, we study the stationary node distribution of a variation of the Random Waypoint mobility model, in which nodes move in a smooth way following one randomly chosen Manhattan path connecting two points. We provide analytical results for the spatial node stationary distribution of this model. As an application, we exploit this result to derive an upper bound on the transmission range...

2015
Kun Su YuJia Wang XinNan Hu

Mobile robot navigation is to find an optimal path to guide the movement of the robot, so path planning is guaranteed to find a feasible optimal path. However, the path planning problem must be solve two problems, i.e., the path must be kept away from obstacles or avoid the collision with obstacles and the length of path should be minimized. In this paper, a path planning algorithm based on ran...

1997
Ram Kesavan Dhabaleswar K. Panda

This paper presents a novel concept of multi-drop path-based multidestination message passing on switch-based irregular networks. First, the multi-drop mechanism is deened with an associated header encoding scheme, and this mechanism is used to develop path-based multidestination worms. Next, a method is proposed to identify valid multidestination paths on arbitrary irregular networks with a ty...

Plasma membrane H+-ATPase is a major integral membrane protein with a role in various physiological processes including abiotic stress response. To study the effect of NaCl on the expression pattern of a gene encoding the plasma membrane H+-ATPase, an experiment was carried out in a completely random design with three replications. A pair of specific primers was designed based on the sequence o...

2004
Zuwairie Ibrahim Yusei Tsuboi Osamu Ono Marzuki Khalid

Deoxyribonucleic Acid or DNA computing has emerged as an interdisciplinary field that draws together chemistry, molecular biology, computer science, and mathematics. From the DNA computing point of view, it has been proven that it is possible to solve weighted graph problems by exploiting some characteristics of DNA such as length, concentration, and melting temperature. In this paper, we prese...

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

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