نتایج جستجو برای: modified neighbor on path mnop

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

Journal: :JNW 2013
Muath A. Obaidat Mohamed Ali Ihsan Shahwan Mohammad S. Obaidat Suhaib Obeidat

To enhance the Quality of service (QoS) communications over mobile ad hoc networks (MANETs), this paper proposes QoS-Aware Multipath Routing Protocol (QMRP). Delay is the most crucial factor for multimedia applications which can be minimized by providing more than one path between source-destination pair as well as choosing the path based on the quality in terms of reliability and stability of ...

Journal: :Transactions of the Society of Instrument and Control Engineers 2013

Journal: :International Journal of Advanced Research in Computer Science and Software Engineering 2018

Journal: :Journal of physics 2023

Abstract As for the efficient and high-precision grinding of blades, it was studied that a flexible path planning method abrasive cloth wheel blades. In paper, based on modified Preston equation, radial material removal depth model is supplemented, which provides theoretical support establishment wheel. After obtaining envelope surface by double parameter sphere family method, deformation amoun...

2016
Rashmi Agrawal

A classification technique is an organized approach for building classification model from given input dataset. The learning algorithm of each technique is employed to build a model used to find the relationship between attribute set and class label of the given input data. Presence of irrelevant information in the data set reduces the speed and quality of learning. The technique of feature sel...

2009
Alex Nash Sven Koenig Maxim Likhachev

We study path planning on grids with blocked and unblocked cells. Any-angle path-planning algorithms find short paths fast because they propagate information along grid edges without constraining the resulting paths to grid edges. Incremental pathplanning algorithms solve a series of similar pathplanning problems faster than repeated single-shot searches because they reuse information from the ...

Ahmad Sadegheih Amir Ebrahimi Zade Mohammad Mehdi Lotfi

Hubs are centers for collection, rearrangement, and redistribution of commodities in transportation networks. In this paper, non-linear multi-objective formulations for single and multiple allocation hub maximal covering problems as well as the linearized versions are proposed. The formulations substantially mitigate complexity of the existing models due to the fewer number of constraints and v...

2016
Upinder Kaur

Nearest neighbor search is one of the most fundamental queries on massive datasets, and it has extensive applications such as pattern recognition, statistical classification, graph algorithms, Location-Based Services and online recommendations. In this report, we propose a new searchable scheme, which can efficiently and securely enable nearest neighbor search over encrypted data on untrusted n...

2017
Grace Selvarani

Zigbee Tree Routing, which doesn't need any routing table/route discovery overhead is used in several resource limited devices and applications. ZTR has a basic limitation regarding providing of optimal routing path as it follows tree topology, hence an optimal routing path can't be achieved. In this paper, we proposed a protocol stated as Shortcut Tree Routing (STR) similar to ZTR&ap...

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

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