• No results found

path algorithm

Exploration of Distance Measurement and Find the Minimal Path Algorithm for Every Node in WSNs Localization

Exploration of Distance Measurement and Find the Minimal Path Algorithm for Every Node in WSNs Localization

... minimal path algorithm, here we consider a WSN environment graph with co-ordinates and find the distance between sensors nodes using the distance formula, after calculate the minimal distance value between ...

7

The Short Path Algorithm Applied to a Toy Model

The Short Path Algorithm Applied to a Toy Model

... short path optimization algorithm on a toy problem, with the potential chosen to depend only on the total Hamming weight to allow simu- lation of larger ...adiabatic algorithm to experience ...

12

A STUDY ON SHORTEST PATH ALGORITHM BASED ON DIJKSTRA?S AND BELLMAN FORD ALGORITHM

A STUDY ON SHORTEST PATH ALGORITHM BASED ON DIJKSTRA?S AND BELLMAN FORD ALGORITHM

... shortest path is an important research topic in graph theory. The shortest path algorithm in the graph theory includes both the one between the particular node pair and the one among all the nodes ...

8

Analysis of Dijkstra’s and A* algorithm to find the shortest path

Analysis of Dijkstra’s and A* algorithm to find the shortest path

... A* algorithm and Dijkstra’s, will probably find the shortest path solution in a very short amount of time and minimum ...A* algorithm, a kind of informed search, is widely used for finding the ...

36

 EDUCATIONAL MODELLING IN CLOUD COMPUTING USING IMS LEARNING DESIGN

 EDUCATIONAL MODELLING IN CLOUD COMPUTING USING IMS LEARNING DESIGN

... 825 In an ad hoc wireless network, the routing and resource management are done in a distributed manner in which all nodes coordinate to enable communication among them as a group. This requires each node to be more ...

5

The Hamiltonicity and Hamiltonian Connectivity of -shaped Supergrid Graphs

The Hamiltonicity and Hamiltonian Connectivity of -shaped Supergrid Graphs

... Hamiltonian path (cycle) and Hamiltonian connected problems on grid, triangular grid, and supergrid graphs have received much ...Hamiltonian path problem on grid graphs is ...Hamiltonian path between ...

6

Subnet Shortest Path Pseudocode based on Dijkstra's Algorithm

Subnet Shortest Path Pseudocode based on Dijkstra's Algorithm

... Non-adaptive algorithm is called static ...shortest path. Dijkstra’s algorithm is a single source shortest path algorithm that can find the shortest paths from a given source node to ...

5

Ms. Kirti, Mrs. Sonal Beniwal (Guide)

Ms. Kirti, Mrs. Sonal Beniwal (Guide)

... proposed algorithm intends to provide security. The Secure Compromising path Algorithm provides a foundation for governing a secure communication system for mobile ad hoc ...safe path. ...

16

Best Path Routing Algorithm for IDS

Best Path Routing Algorithm for IDS

... this algorithm is to choose a path which is best from all ...best path means obviously a path which is best suited for messages so that they can reach from source to their ...a path ...

10

The Longest ( st )-paths of C-shaped Supergrid Graphs

The Longest ( st )-paths of C-shaped Supergrid Graphs

... Hamiltonian path algorithm of [21] on rectangular grid graphs and presented a parallel algorithm for the Hamilto- nian path problem with two given endpoints in rectangular grid ...

7

An efficient algorithm to improve oil gas pipelines path

An efficient algorithm to improve oil gas pipelines path

... shortest path are a key point in software engineering and algo- rithms on these issues are considered a functioning field [1], [2], [16], ...Noisy algorithm, implicit filtering algorithms, direct and a new ...

7

Optimizing Cost-Effective Travel Modes between Two Destinations Using Dijkstra Approach

Optimizing Cost-Effective Travel Modes between Two Destinations Using Dijkstra Approach

... shortest path and minimum cost path in a journey has attracted the researcher’s attention to propose several travel alternatives modes to overcome the ...shortest path problem (TDSPP) and ...

6

Unmanned vehicle path planning using a novel ant colony algorithm

Unmanned vehicle path planning using a novel ant colony algorithm

... optimization algorithm, which is de- rived from the study of ant group behavior, simulates a bionic intelligent optimization algorithm based on the cooperation between ant ...This algorithm has ...

9

Optimization of Wireless Sensor Networks Based on Differential Evolution Algorithm

Optimization of Wireless Sensor Networks Based on Differential Evolution Algorithm

... the algorithm, a cluster can be regarded as a rectangular area in the two-dimensional plane ...a path to transfer information from the source node to the target node, and the minimum energy consumption is ...

13

Title: Shortest Path Searching for Road Network using A* Algorithm

Title: Shortest Path Searching for Road Network using A* Algorithm

... shortest path finding is very difficult in a road network. Shortest path searching is very important in some special case as medical emergency, spying, theft catching, fire brigade ...various path ...

10

Title :    A RECONFIGURABLE ADAPTIVE VITERBI DECODER USING TRACEBACK SCHEMEAuthor (s) : B. Nagaraj

Title : A RECONFIGURABLE ADAPTIVE VITERBI DECODER USING TRACEBACK SCHEMEAuthor (s) : B. Nagaraj

... survivor path. PMU stores the path value of current ...Viterbi algorithm to decode a bitstream that has been encoded using Forward error Correction based on a code, there are also other algorithms ...

5

Obstacle Avoidance Strategy of Intelligent Vehicle Path Planning Based on Particle Swarm Optimization

Obstacle Avoidance Strategy of Intelligent Vehicle Path Planning Based on Particle Swarm Optimization

... The first part is obstacle filling in non-goal area. Geometrically, the linear path is the shortest path when there are no obstacles between the start point and the end point of the path. When the ...

7

Design of Counting Step Algorithm for Smartphone Based Indoor Localization

Design of Counting Step Algorithm for Smartphone Based Indoor Localization

... scoring algorithm of acceleration in the process of step detection is tested in two kinds of path: a straight path and a U-shaped path in which it shows better results than conventional peak ...

7

Study of Network Systems in Practice and Developing an Effective Network to Reduce the Project Duration

Study of Network Systems in Practice and Developing an Effective Network to Reduce the Project Duration

... Dijkstra’s algorithm used for finding shortest path from a vertex to any other ...vertex.Critical Path Method (CPM) is to identify critical activities on the critical path so that resources ...

6

Reliability-Based Controller Placement Algorithm in Software Defined Networking

Reliability-Based Controller Placement Algorithm in Software Defined Networking

... In [30], the authors claim that the reliability can be represented by a combination of possible paths between two nodes, an average length of path, and the maximum oc- cupancy of the link. However, using the ...

14

Show all 10000 documents...

Related subjects