Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `subject:(Shortest Path)`

.
Showing records 1 – 30 of
187 total matches.

◁ [1] [2] [3] [4] [5] [6] [7] ▶

Search Limiters

Dates

- 2015 – 2019 (57)
- 2010 – 2014 (80)
- 2005 – 2009 (41)
- 2000 – 2004 (13)

Degrees

- PhD (31)
- MS (20)
- Docteur es (12)

▼ Search Limiters

Georgia Tech

1.
Lu, Jun.
Method of evolving junctions: a new approach to *path* planning and optimal control.

Degree: PhD, Mathematics, 2014, Georgia Tech

URL: http://hdl.handle.net/1853/53428

► This thesis proposes a novel and efficient method (Method of Evolving Junctions) for solving optimal control problems with *path* constraints, and whose optimal paths are…
(more)

Subjects/Keywords: SDEs; Shortest path; Dynamic environment

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Lu, J. (2014). Method of evolving junctions: a new approach to path planning and optimal control. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/53428

Chicago Manual of Style (16^{th} Edition):

Lu, Jun. “Method of evolving junctions: a new approach to path planning and optimal control.” 2014. Doctoral Dissertation, Georgia Tech. Accessed November 11, 2019. http://hdl.handle.net/1853/53428.

MLA Handbook (7^{th} Edition):

Lu, Jun. “Method of evolving junctions: a new approach to path planning and optimal control.” 2014. Web. 11 Nov 2019.

Vancouver:

Lu J. Method of evolving junctions: a new approach to path planning and optimal control. [Internet] [Doctoral dissertation]. Georgia Tech; 2014. [cited 2019 Nov 11]. Available from: http://hdl.handle.net/1853/53428.

Council of Science Editors:

Lu J. Method of evolving junctions: a new approach to path planning and optimal control. [Doctoral Dissertation]. Georgia Tech; 2014. Available from: http://hdl.handle.net/1853/53428

Vanderbilt University

2. Samal, Chinmaya. Time-dependent and Privacy-Preserving Decentralized Routing using Federated Learning.

Degree: MS, Computer Science, 2019, Vanderbilt University

URL: http://etd.library.vanderbilt.edu/available/etd-07262019-213445/ ;

► With rapid urbanization, route planning is gaining more importance. As transportation networks become more complex and mobility in our society more important, the demand for…
(more)

Subjects/Keywords: routing; shortest path; mobility; transportation

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Samal, C. (2019). Time-dependent and Privacy-Preserving Decentralized Routing using Federated Learning. (Masters Thesis). Vanderbilt University. Retrieved from http://etd.library.vanderbilt.edu/available/etd-07262019-213445/ ;

Chicago Manual of Style (16^{th} Edition):

Samal, Chinmaya. “Time-dependent and Privacy-Preserving Decentralized Routing using Federated Learning.” 2019. Masters Thesis, Vanderbilt University. Accessed November 11, 2019. http://etd.library.vanderbilt.edu/available/etd-07262019-213445/ ;.

MLA Handbook (7^{th} Edition):

Samal, Chinmaya. “Time-dependent and Privacy-Preserving Decentralized Routing using Federated Learning.” 2019. Web. 11 Nov 2019.

Vancouver:

Samal C. Time-dependent and Privacy-Preserving Decentralized Routing using Federated Learning. [Internet] [Masters thesis]. Vanderbilt University; 2019. [cited 2019 Nov 11]. Available from: http://etd.library.vanderbilt.edu/available/etd-07262019-213445/ ;.

Council of Science Editors:

Samal C. Time-dependent and Privacy-Preserving Decentralized Routing using Federated Learning. [Masters Thesis]. Vanderbilt University; 2019. Available from: http://etd.library.vanderbilt.edu/available/etd-07262019-213445/ ;

3.
Sanjabi, Gelareh B.
Efficient Algorithms for Solving Size-Shape-Topology Truss Optimization and *Shortest* *Path* Problems.

Degree: PhD, Civil/Environmental Engineering, 2017, Old Dominion University

URL: 9780355405408 ; https://digitalcommons.odu.edu/cee_etds/19

► Efficient numerical algorithms for solving structural and *Shortest* *Path* (SP) problems are proposed and explained in this study. A variant of the Differential Evolution…
(more)

Subjects/Keywords: Backward shortest path; Bidirectional shortest path; Differential evolution (EV); Discrete variables; Dynamic shortest path; Truss size-shape-topology optimization; Civil Engineering

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Sanjabi, G. B. (2017). Efficient Algorithms for Solving Size-Shape-Topology Truss Optimization and Shortest Path Problems. (Doctoral Dissertation). Old Dominion University. Retrieved from 9780355405408 ; https://digitalcommons.odu.edu/cee_etds/19

Chicago Manual of Style (16^{th} Edition):

Sanjabi, Gelareh B. “Efficient Algorithms for Solving Size-Shape-Topology Truss Optimization and Shortest Path Problems.” 2017. Doctoral Dissertation, Old Dominion University. Accessed November 11, 2019. 9780355405408 ; https://digitalcommons.odu.edu/cee_etds/19.

MLA Handbook (7^{th} Edition):

Sanjabi, Gelareh B. “Efficient Algorithms for Solving Size-Shape-Topology Truss Optimization and Shortest Path Problems.” 2017. Web. 11 Nov 2019.

Vancouver:

Sanjabi GB. Efficient Algorithms for Solving Size-Shape-Topology Truss Optimization and Shortest Path Problems. [Internet] [Doctoral dissertation]. Old Dominion University; 2017. [cited 2019 Nov 11]. Available from: 9780355405408 ; https://digitalcommons.odu.edu/cee_etds/19.

Council of Science Editors:

Sanjabi GB. Efficient Algorithms for Solving Size-Shape-Topology Truss Optimization and Shortest Path Problems. [Doctoral Dissertation]. Old Dominion University; 2017. Available from: 9780355405408 ; https://digitalcommons.odu.edu/cee_etds/19

University of Edinburgh

4. Wang, Feng. Designing a web-based multi-modal route planner for Edinburgh.

Degree: 2011, University of Edinburgh

URL: http://hdl.handle.net/1842/5182

► This paper presents a web-based multi-modal journey planner which assists a large proportion of bus users in Edinburgh to find the optimal route based on…
(more)

Subjects/Keywords: journey planner; shortest path algorithm; bus network

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Wang, F. (2011). Designing a web-based multi-modal route planner for Edinburgh. (Thesis). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/5182

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Wang, Feng. “Designing a web-based multi-modal route planner for Edinburgh.” 2011. Thesis, University of Edinburgh. Accessed November 11, 2019. http://hdl.handle.net/1842/5182.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Wang, Feng. “Designing a web-based multi-modal route planner for Edinburgh.” 2011. Web. 11 Nov 2019.

Vancouver:

Wang F. Designing a web-based multi-modal route planner for Edinburgh. [Internet] [Thesis]. University of Edinburgh; 2011. [cited 2019 Nov 11]. Available from: http://hdl.handle.net/1842/5182.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wang F. Designing a web-based multi-modal route planner for Edinburgh. [Thesis]. University of Edinburgh; 2011. Available from: http://hdl.handle.net/1842/5182

Not specified: Masters Thesis or Doctoral Dissertation

University of Illinois – Urbana-Champaign

5.
Hwang, Leslie K.
Stochastic *shortest* *path* algorithm based on Lagrangian relaxation.

Degree: MS, 1200, 2010, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/16806

► In VLSI circuit design, graph algorithms are widely used and graph structure can model many problems. As technology continues to scale into nanometer design, the…
(more)

Subjects/Keywords: Stochastic shortest path; Variation; Lagrangian relaxation

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Hwang, L. K. (2010). Stochastic shortest path algorithm based on Lagrangian relaxation. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/16806

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Hwang, Leslie K. “Stochastic shortest path algorithm based on Lagrangian relaxation.” 2010. Thesis, University of Illinois – Urbana-Champaign. Accessed November 11, 2019. http://hdl.handle.net/2142/16806.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Hwang, Leslie K. “Stochastic shortest path algorithm based on Lagrangian relaxation.” 2010. Web. 11 Nov 2019.

Vancouver:

Hwang LK. Stochastic shortest path algorithm based on Lagrangian relaxation. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2010. [cited 2019 Nov 11]. Available from: http://hdl.handle.net/2142/16806.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hwang LK. Stochastic shortest path algorithm based on Lagrangian relaxation. [Thesis]. University of Illinois – Urbana-Champaign; 2010. Available from: http://hdl.handle.net/2142/16806

Not specified: Masters Thesis or Doctoral Dissertation

Rochester Institute of Technology

6. Belchikova, Mariya. Graphs with k-Uniform Edge Betweenness Centrality.

Degree: MS, School of Mathematical Sciences (COS), 2018, Rochester Institute of Technology

URL: https://scholarworks.rit.edu/theses/9802

► The edge betweenness centrality of an edge is defined as the ratio of *shortest* paths between all pairs of vertices passing through that edge.…
(more)

Subjects/Keywords: Circulant graph; Edge betweenness centrality; Shortest path

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Belchikova, M. (2018). Graphs with k-Uniform Edge Betweenness Centrality. (Masters Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/9802

Chicago Manual of Style (16^{th} Edition):

Belchikova, Mariya. “Graphs with k-Uniform Edge Betweenness Centrality.” 2018. Masters Thesis, Rochester Institute of Technology. Accessed November 11, 2019. https://scholarworks.rit.edu/theses/9802.

MLA Handbook (7^{th} Edition):

Belchikova, Mariya. “Graphs with k-Uniform Edge Betweenness Centrality.” 2018. Web. 11 Nov 2019.

Vancouver:

Belchikova M. Graphs with k-Uniform Edge Betweenness Centrality. [Internet] [Masters thesis]. Rochester Institute of Technology; 2018. [cited 2019 Nov 11]. Available from: https://scholarworks.rit.edu/theses/9802.

Council of Science Editors:

Belchikova M. Graphs with k-Uniform Edge Betweenness Centrality. [Masters Thesis]. Rochester Institute of Technology; 2018. Available from: https://scholarworks.rit.edu/theses/9802

Clemson University

7.
Masoudi, Nafiseh.
Geometric *Path*-Planning Algorithm in Cluttered 2D Environments Using Convex Hulls.

Degree: MS, Mechanical Engineering, 2017, Clemson University

URL: https://tigerprints.clemson.edu/all_theses/2784

► Routing or *path* planning is the problem of finding a collision-free *path* in an environment usually scattered with multiple objects. Finding the *shortest* route in…
(more)

Subjects/Keywords: Convex hull; Dijkstra; geometric path planning; shortest path

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Masoudi, N. (2017). Geometric Path-Planning Algorithm in Cluttered 2D Environments Using Convex Hulls. (Masters Thesis). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_theses/2784

Chicago Manual of Style (16^{th} Edition):

Masoudi, Nafiseh. “Geometric Path-Planning Algorithm in Cluttered 2D Environments Using Convex Hulls.” 2017. Masters Thesis, Clemson University. Accessed November 11, 2019. https://tigerprints.clemson.edu/all_theses/2784.

MLA Handbook (7^{th} Edition):

Masoudi, Nafiseh. “Geometric Path-Planning Algorithm in Cluttered 2D Environments Using Convex Hulls.” 2017. Web. 11 Nov 2019.

Vancouver:

Masoudi N. Geometric Path-Planning Algorithm in Cluttered 2D Environments Using Convex Hulls. [Internet] [Masters thesis]. Clemson University; 2017. [cited 2019 Nov 11]. Available from: https://tigerprints.clemson.edu/all_theses/2784.

Council of Science Editors:

Masoudi N. Geometric Path-Planning Algorithm in Cluttered 2D Environments Using Convex Hulls. [Masters Thesis]. Clemson University; 2017. Available from: https://tigerprints.clemson.edu/all_theses/2784

Université Catholique de Louvain

8.
Bui, Quoc Trung.
Modelling and solving complex combinatorial optimization problems : quorumcast routing, elementary *shortest* *path*, elementary longest *path* and agricultural land allocation.

Degree: 2015, Université Catholique de Louvain

URL: http://hdl.handle.net/2078.1/169210

►

The feasible solution set of a Combinatorial Optimization Problem (COP) is discrete and finite. Solving a COP is to find optimal solutions in the set… (more)

Subjects/Keywords: Combinatorial Optimization; Shortest Path; Longest Path; Integer Programming

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Bui, Q. T. (2015). Modelling and solving complex combinatorial optimization problems : quorumcast routing, elementary shortest path, elementary longest path and agricultural land allocation. (Thesis). Université Catholique de Louvain. Retrieved from http://hdl.handle.net/2078.1/169210

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Bui, Quoc Trung. “Modelling and solving complex combinatorial optimization problems : quorumcast routing, elementary shortest path, elementary longest path and agricultural land allocation.” 2015. Thesis, Université Catholique de Louvain. Accessed November 11, 2019. http://hdl.handle.net/2078.1/169210.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Bui, Quoc Trung. “Modelling and solving complex combinatorial optimization problems : quorumcast routing, elementary shortest path, elementary longest path and agricultural land allocation.” 2015. Web. 11 Nov 2019.

Vancouver:

Bui QT. Modelling and solving complex combinatorial optimization problems : quorumcast routing, elementary shortest path, elementary longest path and agricultural land allocation. [Internet] [Thesis]. Université Catholique de Louvain; 2015. [cited 2019 Nov 11]. Available from: http://hdl.handle.net/2078.1/169210.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bui QT. Modelling and solving complex combinatorial optimization problems : quorumcast routing, elementary shortest path, elementary longest path and agricultural land allocation. [Thesis]. Université Catholique de Louvain; 2015. Available from: http://hdl.handle.net/2078.1/169210

Not specified: Masters Thesis or Doctoral Dissertation

University of Southern California

9. Demiryurek, Ugur. Query processing in time-dependent spatial networks.

Degree: PhD, Computer Science, 2014, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/120837/rec/5369

► Recent advances in online map services and their wide deployment in hand-held devices and car-navigation systems have led to extensive use of location-based services. The…
(more)

Subjects/Keywords: k nearest neighbor search; road networks; shortest path; spatial networks; time-dependent road networks; time-dependent shortest path

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Demiryurek, U. (2014). Query processing in time-dependent spatial networks. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/120837/rec/5369

Chicago Manual of Style (16^{th} Edition):

Demiryurek, Ugur. “Query processing in time-dependent spatial networks.” 2014. Doctoral Dissertation, University of Southern California. Accessed November 11, 2019. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/120837/rec/5369.

MLA Handbook (7^{th} Edition):

Demiryurek, Ugur. “Query processing in time-dependent spatial networks.” 2014. Web. 11 Nov 2019.

Vancouver:

Demiryurek U. Query processing in time-dependent spatial networks. [Internet] [Doctoral dissertation]. University of Southern California; 2014. [cited 2019 Nov 11]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/120837/rec/5369.

Council of Science Editors:

Demiryurek U. Query processing in time-dependent spatial networks. [Doctoral Dissertation]. University of Southern California; 2014. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/120837/rec/5369

University of Western Australia

10.
Muhandiramge, Ranga.
Maritime manoeuvring optimization : *path* planning in minefield threat environments.

Degree: PhD, 2008, University of Western Australia

URL: http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=5754&local_base=GEN01-INS01

►

The aim of the research project that is the *subject* of this thesis is to apply mathematical techniques, especially those in the area of operations…
(more)

Subjects/Keywords: Path analysis (Statistics); Submarine mines; Operations research; Constrained shortest paths; Path planning; Global optimisation

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Muhandiramge, R. (2008). Maritime manoeuvring optimization : path planning in minefield threat environments. (Doctoral Dissertation). University of Western Australia. Retrieved from http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=5754&local_base=GEN01-INS01

Chicago Manual of Style (16^{th} Edition):

Muhandiramge, Ranga. “Maritime manoeuvring optimization : path planning in minefield threat environments.” 2008. Doctoral Dissertation, University of Western Australia. Accessed November 11, 2019. http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=5754&local_base=GEN01-INS01.

MLA Handbook (7^{th} Edition):

Muhandiramge, Ranga. “Maritime manoeuvring optimization : path planning in minefield threat environments.” 2008. Web. 11 Nov 2019.

Vancouver:

Muhandiramge R. Maritime manoeuvring optimization : path planning in minefield threat environments. [Internet] [Doctoral dissertation]. University of Western Australia; 2008. [cited 2019 Nov 11]. Available from: http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=5754&local_base=GEN01-INS01.

Council of Science Editors:

Muhandiramge R. Maritime manoeuvring optimization : path planning in minefield threat environments. [Doctoral Dissertation]. University of Western Australia; 2008. Available from: http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=5754&local_base=GEN01-INS01

McMaster University

11. Lu, Wei. UNDERSTANDING BIKE SHARE CYCLIST ROUTE CHOICE BEHAVIOR.

Degree: MSc, 2017, McMaster University

URL: http://hdl.handle.net/11375/22150

►

This thesis examines the existence of a dominant route between a hub pair and factors that inﬂuence bike share cyclists route choices. This research collects… (more)

Subjects/Keywords: Active Travel; Bike Share; Cycling; Dominant Route; Route Choice; Shortest Path; Path-Size Logit

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Lu, W. (2017). UNDERSTANDING BIKE SHARE CYCLIST ROUTE CHOICE BEHAVIOR. (Masters Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/22150

Chicago Manual of Style (16^{th} Edition):

Lu, Wei. “UNDERSTANDING BIKE SHARE CYCLIST ROUTE CHOICE BEHAVIOR.” 2017. Masters Thesis, McMaster University. Accessed November 11, 2019. http://hdl.handle.net/11375/22150.

MLA Handbook (7^{th} Edition):

Lu, Wei. “UNDERSTANDING BIKE SHARE CYCLIST ROUTE CHOICE BEHAVIOR.” 2017. Web. 11 Nov 2019.

Vancouver:

Lu W. UNDERSTANDING BIKE SHARE CYCLIST ROUTE CHOICE BEHAVIOR. [Internet] [Masters thesis]. McMaster University; 2017. [cited 2019 Nov 11]. Available from: http://hdl.handle.net/11375/22150.

Council of Science Editors:

Lu W. UNDERSTANDING BIKE SHARE CYCLIST ROUTE CHOICE BEHAVIOR. [Masters Thesis]. McMaster University; 2017. Available from: http://hdl.handle.net/11375/22150

University of Alberta

12.
Islam, Mohammad S.
RELIABLE WIRELESS SENSOR NETWORKS USING MULTIPLE SINKS AND
DEGREE CONSTRAINED *SHORTEST* *PATH* TREES.

Degree: MS, Department of Computing Science, 2013, University of Alberta

URL: https://era.library.ualberta.ca/files/ht24wj59d

► Wireless Sensor networks (WSN) have gained attention in both industry and academia due to their versatile fields of application. One of the main characteristics of…
(more)

Subjects/Keywords: Wireless Sensor Networks; Degree Constraint Shortest Path Tree; Reliability; Multiple Sinks

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Islam, M. S. (2013). RELIABLE WIRELESS SENSOR NETWORKS USING MULTIPLE SINKS AND DEGREE CONSTRAINED SHORTEST PATH TREES. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/ht24wj59d

Chicago Manual of Style (16^{th} Edition):

Islam, Mohammad S. “RELIABLE WIRELESS SENSOR NETWORKS USING MULTIPLE SINKS AND DEGREE CONSTRAINED SHORTEST PATH TREES.” 2013. Masters Thesis, University of Alberta. Accessed November 11, 2019. https://era.library.ualberta.ca/files/ht24wj59d.

MLA Handbook (7^{th} Edition):

Islam, Mohammad S. “RELIABLE WIRELESS SENSOR NETWORKS USING MULTIPLE SINKS AND DEGREE CONSTRAINED SHORTEST PATH TREES.” 2013. Web. 11 Nov 2019.

Vancouver:

Islam MS. RELIABLE WIRELESS SENSOR NETWORKS USING MULTIPLE SINKS AND DEGREE CONSTRAINED SHORTEST PATH TREES. [Internet] [Masters thesis]. University of Alberta; 2013. [cited 2019 Nov 11]. Available from: https://era.library.ualberta.ca/files/ht24wj59d.

Council of Science Editors:

Islam MS. RELIABLE WIRELESS SENSOR NETWORKS USING MULTIPLE SINKS AND DEGREE CONSTRAINED SHORTEST PATH TREES. [Masters Thesis]. University of Alberta; 2013. Available from: https://era.library.ualberta.ca/files/ht24wj59d

Anna University

13. John sanjeev kumar A. Effective route computation Methods for intelligent Transportation systems using spatial Databases;.

Degree: Effective route computation Methods for intelligent Transportation systems using spatial Databases, 2015, Anna University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/32172

►

newlineOne of the features that distinguish Geographical Information newlineSystems GIS from other information systems is spatial information function newlineThis function usually provides selection switches and… (more)

Subjects/Keywords: Geographical Information Systems; Global sampling; Heuristic algorithms; Shortest Path

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

A, J. s. k. (2015). Effective route computation Methods for intelligent Transportation systems using spatial Databases;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/32172

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

A, John sanjeev kumar. “Effective route computation Methods for intelligent Transportation systems using spatial Databases;.” 2015. Thesis, Anna University. Accessed November 11, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/32172.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

A, John sanjeev kumar. “Effective route computation Methods for intelligent Transportation systems using spatial Databases;.” 2015. Web. 11 Nov 2019.

Vancouver:

A Jsk. Effective route computation Methods for intelligent Transportation systems using spatial Databases;. [Internet] [Thesis]. Anna University; 2015. [cited 2019 Nov 11]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/32172.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

A Jsk. Effective route computation Methods for intelligent Transportation systems using spatial Databases;. [Thesis]. Anna University; 2015. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/32172

Not specified: Masters Thesis or Doctoral Dissertation

University of Canterbury

14.
Tian, Lin.
Improved *Shortest* *Path* Algorithms by Dynamic Graph Decomposition.

Degree: Computer Science and Software Engineering, 2006, University of Canterbury

URL: http://hdl.handle.net/10092/1196

► In this thesis, we introduce three new approaches for solving the single source *shortest* *path* (SSSP) problem in nearly acyclic directed graphs, and algorithms based…
(more)

Subjects/Keywords: SSSP; single source shortest path

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Tian, L. (2006). Improved Shortest Path Algorithms by Dynamic Graph Decomposition. (Thesis). University of Canterbury. Retrieved from http://hdl.handle.net/10092/1196

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Tian, Lin. “Improved Shortest Path Algorithms by Dynamic Graph Decomposition.” 2006. Thesis, University of Canterbury. Accessed November 11, 2019. http://hdl.handle.net/10092/1196.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Tian, Lin. “Improved Shortest Path Algorithms by Dynamic Graph Decomposition.” 2006. Web. 11 Nov 2019.

Vancouver:

Tian L. Improved Shortest Path Algorithms by Dynamic Graph Decomposition. [Internet] [Thesis]. University of Canterbury; 2006. [cited 2019 Nov 11]. Available from: http://hdl.handle.net/10092/1196.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tian L. Improved Shortest Path Algorithms by Dynamic Graph Decomposition. [Thesis]. University of Canterbury; 2006. Available from: http://hdl.handle.net/10092/1196

Not specified: Masters Thesis or Doctoral Dissertation

University of Canterbury

15.
Hashim, Mashitoh.
New Algorithm and Data Structures for the All Pairs *Shortest* *Path* Problem.

Degree: Computer Science, 2013, University of Canterbury

URL: http://hdl.handle.net/10092/8196

► In 1985, Moffat-Takaoka (MT) algorithm was developed to solve the all pairs *shortest* *path* (APSP) problem. This algorithm manages to get time complexity of O(n²…
(more)

Subjects/Keywords: Algorithm; Data Structures; All pairs shortest path problem

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Hashim, M. (2013). New Algorithm and Data Structures for the All Pairs Shortest Path Problem. (Thesis). University of Canterbury. Retrieved from http://hdl.handle.net/10092/8196

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Hashim, Mashitoh. “New Algorithm and Data Structures for the All Pairs Shortest Path Problem.” 2013. Thesis, University of Canterbury. Accessed November 11, 2019. http://hdl.handle.net/10092/8196.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Hashim, Mashitoh. “New Algorithm and Data Structures for the All Pairs Shortest Path Problem.” 2013. Web. 11 Nov 2019.

Vancouver:

Hashim M. New Algorithm and Data Structures for the All Pairs Shortest Path Problem. [Internet] [Thesis]. University of Canterbury; 2013. [cited 2019 Nov 11]. Available from: http://hdl.handle.net/10092/8196.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hashim M. New Algorithm and Data Structures for the All Pairs Shortest Path Problem. [Thesis]. University of Canterbury; 2013. Available from: http://hdl.handle.net/10092/8196

Not specified: Masters Thesis or Doctoral Dissertation

University of Cincinnati

16.
HELMICK, MICHAEL T.
EFFICIENT GROUP COMMUNICATION AND THE DEGREE-BOUNDED
*SHORTEST* *PATH* PROBLEM.

Degree: PhD, Engineering : Computer Science and Engineering, 2007, University of Cincinnati

URL: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1178810750

► In this thesis we develop a framework for studying and understanding the tradeoffs involved in efficient multicast route determination. Using this framework, we developed an…
(more)

Subjects/Keywords: Computer Science; multicast; degree-bounded; shortest path; graph theory; Myriad

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

HELMICK, M. T. (2007). EFFICIENT GROUP COMMUNICATION AND THE DEGREE-BOUNDED SHORTEST PATH PROBLEM. (Doctoral Dissertation). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin1178810750

Chicago Manual of Style (16^{th} Edition):

HELMICK, MICHAEL T. “EFFICIENT GROUP COMMUNICATION AND THE DEGREE-BOUNDED SHORTEST PATH PROBLEM.” 2007. Doctoral Dissertation, University of Cincinnati. Accessed November 11, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1178810750.

MLA Handbook (7^{th} Edition):

HELMICK, MICHAEL T. “EFFICIENT GROUP COMMUNICATION AND THE DEGREE-BOUNDED SHORTEST PATH PROBLEM.” 2007. Web. 11 Nov 2019.

Vancouver:

HELMICK MT. EFFICIENT GROUP COMMUNICATION AND THE DEGREE-BOUNDED SHORTEST PATH PROBLEM. [Internet] [Doctoral dissertation]. University of Cincinnati; 2007. [cited 2019 Nov 11]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1178810750.

Council of Science Editors:

HELMICK MT. EFFICIENT GROUP COMMUNICATION AND THE DEGREE-BOUNDED SHORTEST PATH PROBLEM. [Doctoral Dissertation]. University of Cincinnati; 2007. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1178810750

University of Dayton

17. Azimian, Amin. Design of an Intelligent Traffic Management System.

Degree: MS(M.S.), Civil Engineering, 2011, University of Dayton

URL: http://rave.ohiolink.edu/etdc/view?acc_num=dayton1323275800

► Due to present-day significant increases in population and consequently in traffic congestion in most metropolitan cities in the world, designing of an intelligent traffic management…
(more)

Subjects/Keywords: Civil Engineering; Intelligent; traffic detectors; shortest path; travel time; mean speed

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Azimian, A. (2011). Design of an Intelligent Traffic Management System. (Masters Thesis). University of Dayton. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=dayton1323275800

Chicago Manual of Style (16^{th} Edition):

Azimian, Amin. “Design of an Intelligent Traffic Management System.” 2011. Masters Thesis, University of Dayton. Accessed November 11, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=dayton1323275800.

MLA Handbook (7^{th} Edition):

Azimian, Amin. “Design of an Intelligent Traffic Management System.” 2011. Web. 11 Nov 2019.

Vancouver:

Azimian A. Design of an Intelligent Traffic Management System. [Internet] [Masters thesis]. University of Dayton; 2011. [cited 2019 Nov 11]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=dayton1323275800.

Council of Science Editors:

Azimian A. Design of an Intelligent Traffic Management System. [Masters Thesis]. University of Dayton; 2011. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=dayton1323275800

Miami University

18.
Poudel, Pawan.
Computing point-to-point *shortest* *path* using an approximate
distance oracle.

Degree: Master of Computer Science, Computer Science and Systems Analysis, 2008, Miami University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=miami1228887237

► We propose an extremely simple and efficient *shortest* *path* algorithm that computes an optimal *shortest* *path* between a pair of points in a metric space.…
(more)

Subjects/Keywords: Computer Science; APPROXIMATE DISTANCE ORACLE; SHORTEST PATH; vertices

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Poudel, P. (2008). Computing point-to-point shortest path using an approximate distance oracle. (Masters Thesis). Miami University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=miami1228887237

Chicago Manual of Style (16^{th} Edition):

Poudel, Pawan. “Computing point-to-point shortest path using an approximate distance oracle.” 2008. Masters Thesis, Miami University. Accessed November 11, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=miami1228887237.

MLA Handbook (7^{th} Edition):

Poudel, Pawan. “Computing point-to-point shortest path using an approximate distance oracle.” 2008. Web. 11 Nov 2019.

Vancouver:

Poudel P. Computing point-to-point shortest path using an approximate distance oracle. [Internet] [Masters thesis]. Miami University; 2008. [cited 2019 Nov 11]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=miami1228887237.

Council of Science Editors:

Poudel P. Computing point-to-point shortest path using an approximate distance oracle. [Masters Thesis]. Miami University; 2008. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=miami1228887237

Kent State University

19.
Ruan, Ning.
Network Backbone with Applications in Reachability and
*Shortest* *Path* Computation.

Degree: PhD, College of Arts and Sciences / Department of Computer Science, 2012, Kent State University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=kent1334516240

► This dissertation focuses on developing novel techniques to help understand, analyze, and query large graphs by utilizing backbone structures. Network backbone depicts a core…
(more)

Subjects/Keywords: Computer Science; network backbone; graph simplification; reachability; shortest path computation; scalability

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Ruan, N. (2012). Network Backbone with Applications in Reachability and Shortest Path Computation. (Doctoral Dissertation). Kent State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=kent1334516240

Chicago Manual of Style (16^{th} Edition):

Ruan, Ning. “Network Backbone with Applications in Reachability and Shortest Path Computation.” 2012. Doctoral Dissertation, Kent State University. Accessed November 11, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=kent1334516240.

MLA Handbook (7^{th} Edition):

Ruan, Ning. “Network Backbone with Applications in Reachability and Shortest Path Computation.” 2012. Web. 11 Nov 2019.

Vancouver:

Ruan N. Network Backbone with Applications in Reachability and Shortest Path Computation. [Internet] [Doctoral dissertation]. Kent State University; 2012. [cited 2019 Nov 11]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=kent1334516240.

Council of Science Editors:

Ruan N. Network Backbone with Applications in Reachability and Shortest Path Computation. [Doctoral Dissertation]. Kent State University; 2012. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=kent1334516240

Penn State University

20.
Shahid, Talal Ahmed.
* Path* Recommendation for Road Networks.

Degree: MS, Computer Science and Engineering, 2009, Penn State University

URL: https://etda.libraries.psu.edu/catalog/9631

► Finding paths (that can be driving directions, ight itineraries, etc.) from a source to a destination upon a spatial network is a common but non-trivial…
(more)

Subjects/Keywords: Multicriteria paths; Road Networks; Path Search; K-shortest paths

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Shahid, T. A. (2009). Path Recommendation for Road Networks. (Masters Thesis). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/9631

Chicago Manual of Style (16^{th} Edition):

Shahid, Talal Ahmed. “Path Recommendation for Road Networks.” 2009. Masters Thesis, Penn State University. Accessed November 11, 2019. https://etda.libraries.psu.edu/catalog/9631.

MLA Handbook (7^{th} Edition):

Shahid, Talal Ahmed. “Path Recommendation for Road Networks.” 2009. Web. 11 Nov 2019.

Vancouver:

Shahid TA. Path Recommendation for Road Networks. [Internet] [Masters thesis]. Penn State University; 2009. [cited 2019 Nov 11]. Available from: https://etda.libraries.psu.edu/catalog/9631.

Council of Science Editors:

Shahid TA. Path Recommendation for Road Networks. [Masters Thesis]. Penn State University; 2009. Available from: https://etda.libraries.psu.edu/catalog/9631

Kent State University

21. Althoubi, Asaad Y. An Analysis of one approximation algorithm for graph linearization.

Degree: MS, College of Arts and Sciences / Department of Computer Science, 2017, Kent State University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=kent1493052478987958

► The Minimum Eccentricity *Shortest* *Path* (MESP) Problem consists of determining a *shortest* *path* (a *path* of minimum length between its extremities) of minimum eccentricity in…
(more)

Subjects/Keywords: Computer Science; Graph linearization, Minimum Eccentricity Shortest Path

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Althoubi, A. Y. (2017). An Analysis of one approximation algorithm for graph linearization. (Masters Thesis). Kent State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=kent1493052478987958

Chicago Manual of Style (16^{th} Edition):

Althoubi, Asaad Y. “An Analysis of one approximation algorithm for graph linearization.” 2017. Masters Thesis, Kent State University. Accessed November 11, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=kent1493052478987958.

MLA Handbook (7^{th} Edition):

Althoubi, Asaad Y. “An Analysis of one approximation algorithm for graph linearization.” 2017. Web. 11 Nov 2019.

Vancouver:

Althoubi AY. An Analysis of one approximation algorithm for graph linearization. [Internet] [Masters thesis]. Kent State University; 2017. [cited 2019 Nov 11]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=kent1493052478987958.

Council of Science Editors:

Althoubi AY. An Analysis of one approximation algorithm for graph linearization. [Masters Thesis]. Kent State University; 2017. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=kent1493052478987958

Delft University of Technology

22. Loof, P.C. Improving vehicle routing using traffic predictions:.

Degree: 2014, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:df10f760-6b11-4fea-aa99-309a3f10b4a4

► Vehicle routing through road networks is an important topic of research: time and money can be saved by reducing traffic jams, which would also reduce…
(more)

Subjects/Keywords: traffic routing; shortest path problem; traffic forecasting; micro-simulation

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Loof, P. C. (2014). Improving vehicle routing using traffic predictions:. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:df10f760-6b11-4fea-aa99-309a3f10b4a4

Chicago Manual of Style (16^{th} Edition):

Loof, P C. “Improving vehicle routing using traffic predictions:.” 2014. Masters Thesis, Delft University of Technology. Accessed November 11, 2019. http://resolver.tudelft.nl/uuid:df10f760-6b11-4fea-aa99-309a3f10b4a4.

MLA Handbook (7^{th} Edition):

Loof, P C. “Improving vehicle routing using traffic predictions:.” 2014. Web. 11 Nov 2019.

Vancouver:

Loof PC. Improving vehicle routing using traffic predictions:. [Internet] [Masters thesis]. Delft University of Technology; 2014. [cited 2019 Nov 11]. Available from: http://resolver.tudelft.nl/uuid:df10f760-6b11-4fea-aa99-309a3f10b4a4.

Council of Science Editors:

Loof PC. Improving vehicle routing using traffic predictions:. [Masters Thesis]. Delft University of Technology; 2014. Available from: http://resolver.tudelft.nl/uuid:df10f760-6b11-4fea-aa99-309a3f10b4a4

Oklahoma State University

23.
Bright, Julie Anna.
Robust *Shortest* Paths under Uncertainty Using Conditional Value-at-Risk.

Degree: Industrial Engineering & Management, 2011, Oklahoma State University

URL: http://hdl.handle.net/11244/9846

► Finding a *shortest* *path* in a network is a classical problem in discrete optimization. The systems underlying the network models are subjects to a variety…
(more)

Subjects/Keywords: cvar; modeling; networks; optimization; shortest path; stochastic optimization

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Bright, J. A. (2011). Robust Shortest Paths under Uncertainty Using Conditional Value-at-Risk. (Thesis). Oklahoma State University. Retrieved from http://hdl.handle.net/11244/9846

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Bright, Julie Anna. “Robust Shortest Paths under Uncertainty Using Conditional Value-at-Risk.” 2011. Thesis, Oklahoma State University. Accessed November 11, 2019. http://hdl.handle.net/11244/9846.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Bright, Julie Anna. “Robust Shortest Paths under Uncertainty Using Conditional Value-at-Risk.” 2011. Web. 11 Nov 2019.

Vancouver:

Bright JA. Robust Shortest Paths under Uncertainty Using Conditional Value-at-Risk. [Internet] [Thesis]. Oklahoma State University; 2011. [cited 2019 Nov 11]. Available from: http://hdl.handle.net/11244/9846.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bright JA. Robust Shortest Paths under Uncertainty Using Conditional Value-at-Risk. [Thesis]. Oklahoma State University; 2011. Available from: http://hdl.handle.net/11244/9846

Not specified: Masters Thesis or Doctoral Dissertation

Virginia Commonwealth University

24. Donachy, Shaun. Spiking Neural Networks: Neuron Models, Plasticity, and Graph Applications.

Degree: MS, Computer Science, 2015, Virginia Commonwealth University

URL: https://scholarscompass.vcu.edu/etd/3984

► Networks of spiking neurons can be used not only for brain modeling but also to solve graph problems. With the use of a computationally…
(more)

Subjects/Keywords: Spiking Neural Networks; Plasticity; Shortest Path; Graph Clustering; Theory and Algorithms

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Donachy, S. (2015). Spiking Neural Networks: Neuron Models, Plasticity, and Graph Applications. (Thesis). Virginia Commonwealth University. Retrieved from https://scholarscompass.vcu.edu/etd/3984

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Donachy, Shaun. “Spiking Neural Networks: Neuron Models, Plasticity, and Graph Applications.” 2015. Thesis, Virginia Commonwealth University. Accessed November 11, 2019. https://scholarscompass.vcu.edu/etd/3984.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Donachy, Shaun. “Spiking Neural Networks: Neuron Models, Plasticity, and Graph Applications.” 2015. Web. 11 Nov 2019.

Vancouver:

Donachy S. Spiking Neural Networks: Neuron Models, Plasticity, and Graph Applications. [Internet] [Thesis]. Virginia Commonwealth University; 2015. [cited 2019 Nov 11]. Available from: https://scholarscompass.vcu.edu/etd/3984.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Donachy S. Spiking Neural Networks: Neuron Models, Plasticity, and Graph Applications. [Thesis]. Virginia Commonwealth University; 2015. Available from: https://scholarscompass.vcu.edu/etd/3984

Not specified: Masters Thesis or Doctoral Dissertation

Wayne State University

25. Xi, Yong. Location Privacy In Emerging Network-Based Applications.

Degree: PhD, Computer Science, 2012, Wayne State University

URL: https://digitalcommons.wayne.edu/oa_dissertations/626

► With the wide spread of computer systems and networks, privacy has become an issue that increasingly attracts attention. In wireless sensor networks, the location…
(more)

Subjects/Keywords: Anonymity; Location Privacy; Privacy; Sensor Network; Shortest Path Routing; Computer Sciences

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Xi, Y. (2012). Location Privacy In Emerging Network-Based Applications. (Doctoral Dissertation). Wayne State University. Retrieved from https://digitalcommons.wayne.edu/oa_dissertations/626

Chicago Manual of Style (16^{th} Edition):

Xi, Yong. “Location Privacy In Emerging Network-Based Applications.” 2012. Doctoral Dissertation, Wayne State University. Accessed November 11, 2019. https://digitalcommons.wayne.edu/oa_dissertations/626.

MLA Handbook (7^{th} Edition):

Xi, Yong. “Location Privacy In Emerging Network-Based Applications.” 2012. Web. 11 Nov 2019.

Vancouver:

Xi Y. Location Privacy In Emerging Network-Based Applications. [Internet] [Doctoral dissertation]. Wayne State University; 2012. [cited 2019 Nov 11]. Available from: https://digitalcommons.wayne.edu/oa_dissertations/626.

Council of Science Editors:

Xi Y. Location Privacy In Emerging Network-Based Applications. [Doctoral Dissertation]. Wayne State University; 2012. Available from: https://digitalcommons.wayne.edu/oa_dissertations/626

University of Minnesota

26. Gunturi, Venkata Maruti Viswanath. Big Temporally-Detailed Graph Data Analytics.

Degree: PhD, Computer Science, 2015, University of Minnesota

URL: http://hdl.handle.net/11299/175447

► Increasingly, temporally-detailed graphs are of a size, variety, and update rate that exceed the capability of current computing technologies. Such datasets can be called Big…
(more)

Subjects/Keywords: Databases; Graphs; Optimization; Shortest Path Algorithm; Spatial Network

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Gunturi, V. M. V. (2015). Big Temporally-Detailed Graph Data Analytics. (Doctoral Dissertation). University of Minnesota. Retrieved from http://hdl.handle.net/11299/175447

Chicago Manual of Style (16^{th} Edition):

Gunturi, Venkata Maruti Viswanath. “Big Temporally-Detailed Graph Data Analytics.” 2015. Doctoral Dissertation, University of Minnesota. Accessed November 11, 2019. http://hdl.handle.net/11299/175447.

MLA Handbook (7^{th} Edition):

Gunturi, Venkata Maruti Viswanath. “Big Temporally-Detailed Graph Data Analytics.” 2015. Web. 11 Nov 2019.

Vancouver:

Gunturi VMV. Big Temporally-Detailed Graph Data Analytics. [Internet] [Doctoral dissertation]. University of Minnesota; 2015. [cited 2019 Nov 11]. Available from: http://hdl.handle.net/11299/175447.

Council of Science Editors:

Gunturi VMV. Big Temporally-Detailed Graph Data Analytics. [Doctoral Dissertation]. University of Minnesota; 2015. Available from: http://hdl.handle.net/11299/175447

Arizona State University

27. Pasumarthy, Nitin. SPSR Efficient Processing of Socially k-Nearest Neighbors with Spatial Range Filter.

Degree: Computer Science, 2016, Arizona State University

URL: http://repository.asu.edu/items/40219

► Social media has become popular in the past decade. Facebook for example has 1.59 billion active users monthly. With such massive social networks generating lot…
(more)

Subjects/Keywords: Computer science; Computer engineering; database; geosocial; graph; index; knn; shortest path

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Pasumarthy, N. (2016). SPSR Efficient Processing of Socially k-Nearest Neighbors with Spatial Range Filter. (Masters Thesis). Arizona State University. Retrieved from http://repository.asu.edu/items/40219

Chicago Manual of Style (16^{th} Edition):

Pasumarthy, Nitin. “SPSR Efficient Processing of Socially k-Nearest Neighbors with Spatial Range Filter.” 2016. Masters Thesis, Arizona State University. Accessed November 11, 2019. http://repository.asu.edu/items/40219.

MLA Handbook (7^{th} Edition):

Pasumarthy, Nitin. “SPSR Efficient Processing of Socially k-Nearest Neighbors with Spatial Range Filter.” 2016. Web. 11 Nov 2019.

Vancouver:

Pasumarthy N. SPSR Efficient Processing of Socially k-Nearest Neighbors with Spatial Range Filter. [Internet] [Masters thesis]. Arizona State University; 2016. [cited 2019 Nov 11]. Available from: http://repository.asu.edu/items/40219.

Council of Science Editors:

Pasumarthy N. SPSR Efficient Processing of Socially k-Nearest Neighbors with Spatial Range Filter. [Masters Thesis]. Arizona State University; 2016. Available from: http://repository.asu.edu/items/40219

Texas A&M University

28. Ursulenko, Oleksii. Exact Methods In Fractional Combinatorial Optimization.

Degree: 2011, Texas A&M University

URL: http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7482

► This dissertation considers a subclass of sum-of-ratios fractional combinatorial optimization problems (FCOPs) whose linear versions admit polynomial-time exact algorithms. This topic lies in the intersection…
(more)

Subjects/Keywords: sum of ratios; fractional combinatorial optimization; fractional programming; spanning tree; shortest path; shortest cycle; image space

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Ursulenko, O. (2011). Exact Methods In Fractional Combinatorial Optimization. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7482

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Ursulenko, Oleksii. “Exact Methods In Fractional Combinatorial Optimization.” 2011. Thesis, Texas A&M University. Accessed November 11, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7482.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Ursulenko, Oleksii. “Exact Methods In Fractional Combinatorial Optimization.” 2011. Web. 11 Nov 2019.

Vancouver:

Ursulenko O. Exact Methods In Fractional Combinatorial Optimization. [Internet] [Thesis]. Texas A&M University; 2011. [cited 2019 Nov 11]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7482.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ursulenko O. Exact Methods In Fractional Combinatorial Optimization. [Thesis]. Texas A&M University; 2011. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7482

Not specified: Masters Thesis or Doctoral Dissertation

29. Medrano, Fernando Antonio. Corridor Location: Generating Competitive and Efficient Route Alternatives.

Degree: 2014, University of California – eScholarship, University of California

URL: http://www.escholarship.org/uc/item/4g92536t

► The problem of transmission line corridor location can be considered, at best, a "wicked" public systems decision problem. It requires the consideration of numerous objectives…
(more)

Subjects/Keywords: Geographic information science and geodesy; Computer science; Geography; combinatorial optimization; heuristics; multiobjective optimization; near shortest paths; parallel computing; shortest path algorithms

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Medrano, F. A. (2014). Corridor Location: Generating Competitive and Efficient Route Alternatives. (Thesis). University of California – eScholarship, University of California. Retrieved from http://www.escholarship.org/uc/item/4g92536t

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Medrano, Fernando Antonio. “Corridor Location: Generating Competitive and Efficient Route Alternatives.” 2014. Thesis, University of California – eScholarship, University of California. Accessed November 11, 2019. http://www.escholarship.org/uc/item/4g92536t.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Medrano, Fernando Antonio. “Corridor Location: Generating Competitive and Efficient Route Alternatives.” 2014. Web. 11 Nov 2019.

Vancouver:

Medrano FA. Corridor Location: Generating Competitive and Efficient Route Alternatives. [Internet] [Thesis]. University of California – eScholarship, University of California; 2014. [cited 2019 Nov 11]. Available from: http://www.escholarship.org/uc/item/4g92536t.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Medrano FA. Corridor Location: Generating Competitive and Efficient Route Alternatives. [Thesis]. University of California – eScholarship, University of California; 2014. Available from: http://www.escholarship.org/uc/item/4g92536t

Not specified: Masters Thesis or Doctoral Dissertation

Anna University

30.
Subramani, T.
Traffic study on road network to implement transport
facility projects and to identify the *shortest* travelling *path*
using GIS for salem; -.

Degree: Civil Engineering, 2014, Anna University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/22856

►

Salem is the fifth largest city with a population of 7 54 lakhs 2011 in Tamil Nadu Rapid growth in the big cities has caused… (more)

Subjects/Keywords: Civil engineering; Geographic information system; Road network; Shortest travelling path; Traffic study; Transport facility

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Subramani, T. (2014). Traffic study on road network to implement transport facility projects and to identify the shortest travelling path using GIS for salem; -. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/22856

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Subramani, T. “Traffic study on road network to implement transport facility projects and to identify the shortest travelling path using GIS for salem; -.” 2014. Thesis, Anna University. Accessed November 11, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/22856.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Subramani, T. “Traffic study on road network to implement transport facility projects and to identify the shortest travelling path using GIS for salem; -.” 2014. Web. 11 Nov 2019.

Vancouver:

Subramani T. Traffic study on road network to implement transport facility projects and to identify the shortest travelling path using GIS for salem; -. [Internet] [Thesis]. Anna University; 2014. [cited 2019 Nov 11]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/22856.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Subramani T. Traffic study on road network to implement transport facility projects and to identify the shortest travelling path using GIS for salem; -. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/22856

Not specified: Masters Thesis or Doctoral Dissertation