نتایج جستجو برای: dynamic key path discovery algorithm

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

Journal: :ITOR 2011
Roger Reis Marcus Ritt Luciana S. Buriol Mauricio G. C. Resende

Interior gateway routing protocols like OSPF (Open Shortest Path First) and DEFT (Distributed Exponentially-Weighted Flow Splitting) send flow through forward links towards the destination node. OSPF routes only on shortest-weight paths, whereas DEFT sends flow on all forward links, but with an exponential penalty on longer paths. Finding suitable weights for these protocols is known as the wei...

Journal: :JSW 2014
Hong Liu Yuanyuan Li Hanchao Yu

Traditional animation by key frame techniques takes animators lots of time and vigour to model and simulate behaviours of crowds. For solving this problem, this paper presents a novel group animation generation approach based on population-based optimization algorithms. It is mainly divided into two parts. First, it puts forward a role modelling approach based on dynamic selfadaptive genetic al...

2017
Jay Prakash Rakesh Kumar Jai Prakash Saini Madan Mohan Malaviya

Mobile Ad-hoc Networks (MANETs) find numerous applications. Its utility can be extended by integrating it with Internet. Some real-life applications where such integrated networks can be used are disaster situation viz., earthquake, battle fields etc. MANETs are dynamic topology, infrastructure less and standalone networks of wireless mobile nodes. To overcome this limitation, MANET needs to co...

Journal: :CoRR 2013
Hairong Liu Longin Jan Latecki Shuicheng Yan

In this paper, we propose a path following replicator dynamic, and investigate its potentials in uncovering the underlying cluster structure of a graph. The proposed dynamic is a generalization of the discrete replicator dynamic, which evolves to a local maximum of the optimization problem max f(x) = xWx,x ∈ ∆ (W is a non-negative square matrix and ∆ is a simplex), and has been widely used to s...

2002
Sandeep S. Kulkarni Bezawada Bruhadeshwar

In this paper, we focus on the problem of secure multicast in dynamic groups. In this problem, a group of users communicate using a shared key. Due to the dynamic nature of these groups, to preserve secrecy, it is necessary to change the group key whenever the group membership changes. While the group key is being changed, the group communication needs to be interrupted until the rekeying is co...

Journal: :Int. J. Computational Intelligence Systems 2012
Mansour Sheikhan Ehsan Hemmati

Mobile ad-hoc network (MANET) is a dynamic collection of mobile computers without the need for any existing infrastructure. Nodes in a MANET act as hosts and routers. Designing of robust routing algorithms for MANETs is a challenging task. Disjoint multipath routing protocols address this problem and increase the reliability, security and lifetime of network. However, selecting an optimal multi...

Journal: :Journal of Systems Engineering and Electronics 2020

Journal: :International Journal of Advanced Computer Science and Applications 2023

In the Automated Guided Vehicle (AGV) warehouse automatic guided vehicle system, path planning algorithm for intelligent logistics vehicles is a key factor to ensure stable and efficient operation of system. However, existing algorithms have problems such as single designing route inability intelligently evade moving barriers. The academic community has proposed various solutions these problems...

2012
K. V. Viswanatha

Mobile Ad hoc network consists of a set of mobile nodes. It is a dynamic network which does not have fixed topology. This network does not have any infrastructure or central administration, hence it is called infrastructure-less network. The change in topology makes the route from source to destination as dynamic fixed and changes with respect to time. The nature of network requires the algorit...

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

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