• No results found

one-to-one shortest path problem

An Extended Shortest Path Problem with Switch Cost Between Arcs

An Extended Shortest Path Problem with Switch Cost Between Arcs

... standard shortest path problem only considers the cost on the arc, and it doesn’t consider the cost of switch- ing between ...the problem by considering switch cost between ...the ...

6

A New Approach for Solving Type-2 Fuzzy Shortest Path Problem

A New Approach for Solving Type-2 Fuzzy Shortest Path Problem

... the shortest path problem is the problem of finding a path between two vertices such that the sum of the weights of the corresponding edges is ...world problem the arc length of ...

10

Adapted A* Algorithm for the Shortest Path Problem with Position-Based Learning Effects

Adapted A* Algorithm for the Shortest Path Problem with Position-Based Learning Effects

... The shortest path is the one with the minimum total ...DSPP problem with learning experiences or effects (SPLEs) has not been considered ...a path usually change with learning ...

7

The On-Line Shortest Path Problem Under Partial Monitoring

The On-Line Shortest Path Problem Under Partial Monitoring

... on-line shortest path problem is considered under various models of partial ...a path between two distinguished vertices such that the loss of the chosen path (defined as the sum of the ...

35

Novel Approach to Fuzzy Shortest Path Problem

Novel Approach to Fuzzy Shortest Path Problem

... The shortest path problem is an important classical network optimization problem arising from many applications including robotics, networking, and ...network-theoretic problem may be ...

8

Z-Dijkstra’s Algorithm to solve Shortest Path Problem  in a Z-Graph

Z-Dijkstra’s Algorithm to solve Shortest Path Problem in a Z-Graph

... the Shortest Path Problem (SPP) is one of the most famous problems studied and being studied by ...the problem of finding a path between two vertices (or nodes) in a digraph such ...

7

A Novel Approach of the Shortest Path Problem Using P System

A Novel Approach of the Shortest Path Problem Using P System

... The shortest path problem (SPP) is used in order to find a path possessing hold the minimum travel cost, from one or more start point to one or more goal in a linked ...enough. ...

11

Parallel Implementations for Solving Shortest Path Problem using Bellman Ford

Parallel Implementations for Solving Shortest Path Problem using Bellman Ford

... Single source shortest path problem finds application in large domains of scientific and real world. Common applications of these algorithms are in network routing [6], VLSI design, robotics and ...

6

An Android Application to solve the shortest path problem using Google Services and Dijkstra's Algorithm

An Android Application to solve the shortest path problem using Google Services and Dijkstra's Algorithm

... the shortest path ...this problem has to do with the theory of ...optimum path on Google map and solve the shortest path problem as alternative of Dijkstra's ...

8

A Novel Approach for finding a Shortest Path Problem with Intuitionistic Fuzzy Network

A Novel Approach for finding a Shortest Path Problem with Intuitionistic Fuzzy Network

... solving shortest path problem on a network with triangular intuitionistic fuzzy arc lengths, where the shortest path is identified using the concept of ranking ...the shortest ...

8

The Resource constrained shortest path problem implemented in a lazy functional language

The Resource constrained shortest path problem implemented in a lazy functional language

... the shortest path can be expressed using two arrays, each indexed by ...default path lists is built by the function ...a path is available for every ...

17

Shortest Path Problem on Intuitionistic Fuzzy Network

Shortest Path Problem on Intuitionistic Fuzzy Network

... Finding shortest paths in graphs has been the area of interest for many ...researchers. Shortest paths are one of the fundamental and most widely used concepts in ...Fuzzy Shortest Path ...

11

OPTIMAL SOLUTION FOR SHORTEST PATH PROBLEM USING HEURISTIC SEARCH TECHNIQUE

OPTIMAL SOLUTION FOR SHORTEST PATH PROBLEM USING HEURISTIC SEARCH TECHNIQUE

... use problem specific knowledge, beyond the problem definition ...the shortest path ...the shortest path between given pair of ...

10

An Efficient Algorithm for Finding Top-K Shortest Simple Path

An Efficient Algorithm for Finding Top-K Shortest Simple Path

... The shortest-path distance between vertices in a network is a fundamental concept in graph theory and is widely applied in the AI and Web ...K shortest paths (KSP) problem has been extensively ...

6

Complement of Type-2 Fuzzy Shortest Path Using Possibility Measure

Complement of Type-2 Fuzzy Shortest Path Using Possibility Measure

... the shortest path problem is the problem of finding a path between source node to destination node on a ...world problem the arc length of the network may represent the time or ...

9

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

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

... Dijkstra algorithm is one of the classical algorithms in SPP, specialized in single-source shortest path problem in a directed graph with nonnegative weight. Dijkstra is a simpler and faster ...

6

All Pairs Shortest Paths Algorithm for High dimensional Sparse Graphs

All Pairs Shortest Paths Algorithm for High dimensional Sparse Graphs

... (all-pairs shortest path problem) is one of the most popular tasks in graph theory because the shortest paths between all pairs of vertices are used for solving many problems involving ...

5

On a New Notation of Fuzzy Subgroup

On a New Notation of Fuzzy Subgroup

... 3. M. K. Luhandjula, "Fuzzy optimization: milestones and perspectives," Fuzzy Sets and Systems, vol. 274, pp. 4-11, 2015. 4. S. Broumi, A. Dey, M. Talea, A. Bakali, F. Smarandac -he, D. Nagarajan, M. ...

6

Application of Floyd’s Algorithm for Knust Fire Service

Application of Floyd’s Algorithm for Knust Fire Service

... pairs shortest path algorithm. It will calculate the shortest path between all possible pairs of vertices in a (possibly weighted) graph or digraph concurrently in time (where n is the number ...

10

Avoiding Unnecessary Calculations in Robot Navigation

Avoiding Unnecessary Calculations in Robot Navigation

... Abstract— For solving problems of robot navigation over un- known and changing terrain, many algorithms have been in- vented. For example, D* Lite, which is a dynamic, incremen- tal search algorithm, is the most ...

6

Show all 10000 documents...

Related subjects