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

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

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه پیام نور استان مازندران - دانشکده ریاضی 1390

abstract this thesis includes five chapter : the first chapter assign to establish fuzzy mathematics requirement and introduction of liner programming in thesis. the second chapter we introduce a multilevel linear programming problems. the third chapter we proposed interactive fuzzy programming which consists of two phases , the study termination conditions of algorithm we show a satisfac...

Journal: :Applied Mathematics and Computer Science 2009
Alicja Mazur Dawid Szakiel

This paper describes the problem of designing control laws for path following robots, including two types of nonholonomic mobile manipulators. Due to a cascade structure of the motion equation, a backstepping procedure is used to achieve motion along a desired path. The control algorithm consists of two simultaneously working controllers: the kinematic controller, solving motion constraints, an...

2012
T.Suryaprakash Reddy

In the recent times many accessible congestion control procedures have no capability to differentiate involving two major problems like packet loss by link crash and packet loss by congestion. Consequently these resolutions effect in form of wastage of possessions because they target only on the packet drop by link crash that has a needless importance. Consumption of energy and possessions in o...

2016
Li Gang Jingfang Wang

The PRM (probabilistic roadmap method) path planning algorithm is applied to the mobile robot path planning problem of limited environment. And a path optimization algorithm based on modified node enhancement strategies and geometric smoothing is proposed. The node enhancing method is used to optimize the initial planning with the base PRM algorithm, the original path nodes are gradually substi...

2001
Murali S. Kodialam T. V. Lakshman

This paper presents new algorithms for dynamic routing of locally restorable bandwidth guaranteed paths. Dynamic routing implies routing of requests that arrive one-by-one with no a priori knowledge of future arrivals, and so necessitating use of on-line algorithms. Local restorability means that upon a link or node failure, the first node upstream from the failure must be able to switch the pa...

Journal: :Electronic Notes in Discrete Mathematics 2004
Giovanni Righini Matteo Salani

In this paper we consider a label-setting dynamic-programming algorithm for the Elementary Shortest Path Problem with Resource Constraints (ESPPRC). We use a pseudo resource to guarantee that labels are permanent. We observe that storing the states based on the subset of nodes visited by the associated path can improve the performance of the algorithm significantly. To this end we use a variant...

Journal: :Applied sciences 2023

Quantum key distribution (QKD) is an encrypted communication technique based on the principles of quantum mechanics that ensures security by exploiting properties states. Currently, transmission efficiency QKD system low. Trusted relay technology used to solve this problem and achieve long-distance transmission. However, trusted relaying alone cannot decrypt issues poor link stability low utili...

Journal: :IEICE Transactions 2012
Takahiro Ogawa Hiroshi Hasegawa Ken-ichi Sato

We propose a novel dynamic hierarchical optical path network architecture that achieves efficient optical fast circuit switching. In order to complete wavelength path setup/teardown efficiently, the proposed network adaptively manages waveband paths and bundles of optical paths, which provide virtual mesh connectivity between node pairs for wavelength paths. Numerical experiments show that oper...

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

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