Advanced search options

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

You searched for `subject:(shortest path algorithm)`

.
Showing records 1 – 30 of
41 total matches.

▼ Search Limiters

University of Edinburgh

1. 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 December 12, 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. 12 Dec 2019.

Vancouver:

Wang F. Designing a web-based multi-modal route planner for Edinburgh. [Internet] [Thesis]. University of Edinburgh; 2011. [cited 2019 Dec 12]. 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 Canterbury

2.
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 December 12, 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. 12 Dec 2019.

Vancouver:

Hashim M. New Algorithm and Data Structures for the All Pairs Shortest Path Problem. [Internet] [Thesis]. University of Canterbury; 2013. [cited 2019 Dec 12]. 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 Minnesota

3. 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 December 12, 2019. http://hdl.handle.net/11299/175447.

MLA Handbook (7^{th} Edition):

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

Vancouver:

Gunturi VMV. Big Temporally-Detailed Graph Data Analytics. [Internet] [Doctoral dissertation]. University of Minnesota; 2015. [cited 2019 Dec 12]. 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

Université Catholique de Louvain

4. Alabart Gutierrez del Olmo, Carmen. Tracking of the growth of roots based on multi-object tracking techniques.

Degree: 2017, Université Catholique de Louvain

URL: http://hdl.handle.net/2078.1/thesis:10642

►

Multi-object tracking (MOT) is based on the detection of several objects in individual frames at different time instants and then its association across time, obtaining… (more)

Subjects/Keywords: Multi-Object Tracking (MOT); Shortest Path; Dijkstra Algorithm; Hungarian Algorithm; Plant Root System

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Alabart Gutierrez del Olmo, C. (2017). Tracking of the growth of roots based on multi-object tracking techniques. (Thesis). Université Catholique de Louvain. Retrieved from http://hdl.handle.net/2078.1/thesis:10642

Not specified: Masters Thesis or Doctoral Dissertation

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

Alabart Gutierrez del Olmo, Carmen. “Tracking of the growth of roots based on multi-object tracking techniques.” 2017. Thesis, Université Catholique de Louvain. Accessed December 12, 2019. http://hdl.handle.net/2078.1/thesis:10642.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Alabart Gutierrez del Olmo, Carmen. “Tracking of the growth of roots based on multi-object tracking techniques.” 2017. Web. 12 Dec 2019.

Vancouver:

Alabart Gutierrez del Olmo C. Tracking of the growth of roots based on multi-object tracking techniques. [Internet] [Thesis]. Université Catholique de Louvain; 2017. [cited 2019 Dec 12]. Available from: http://hdl.handle.net/2078.1/thesis:10642.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Alabart Gutierrez del Olmo C. Tracking of the growth of roots based on multi-object tracking techniques. [Thesis]. Université Catholique de Louvain; 2017. Available from: http://hdl.handle.net/2078.1/thesis:10642

Not specified: Masters Thesis or Doctoral Dissertation

5.
Farooq, Farhan.
Optimal *Path* Searching through Specified Routes using different Algorithms.

Degree: Computer Engineering, 2009, Dalarna University

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:du-4530

► To connect different electrical, network and data devices with the minimum cost and *shortest* *path*, is a complex job. In huge buildings, where the…
(more)

Subjects/Keywords: Routing problem; Shortest Path; Greedy Algorithm; Simulated Annealing; Exhaustive Search; Travelling Salesman Problem; Combinatorial Optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Farooq, F. (2009). Optimal Path Searching through Specified Routes using different Algorithms. (Thesis). Dalarna University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:du-4530

Not specified: Masters Thesis or Doctoral Dissertation

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

Farooq, Farhan. “Optimal Path Searching through Specified Routes using different Algorithms.” 2009. Thesis, Dalarna University. Accessed December 12, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:du-4530.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Farooq, Farhan. “Optimal Path Searching through Specified Routes using different Algorithms.” 2009. Web. 12 Dec 2019.

Vancouver:

Farooq F. Optimal Path Searching through Specified Routes using different Algorithms. [Internet] [Thesis]. Dalarna University; 2009. [cited 2019 Dec 12]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:du-4530.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Farooq F. Optimal Path Searching through Specified Routes using different Algorithms. [Thesis]. Dalarna University; 2009. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:du-4530

Not specified: Masters Thesis or Doctoral Dissertation

George Mason University

6.
Zhou, Xi.
Revealed *Path* Choice Behavior and Network Pruning for Efficient *Path* Finding
.

Degree: 2014, George Mason University

URL: http://hdl.handle.net/1920/8920

This dissertation addresses two separate problems related to transportation networks. In the first part, route choice behavior revealed from real world trips is studied. In part two, efficient pruning of large transportation networks for expediting one-to-one path search is studied.
*Advisors/Committee Members: Venigalla, Mohan M (advisor).*

Subjects/Keywords: Transportation planning; GPS-Tracking Trip; Route Choice Behavior; Shortest Path Algorithm; Sub-network; Turn Penalty

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zhou, X. (2014). Revealed Path Choice Behavior and Network Pruning for Efficient Path Finding . (Thesis). George Mason University. Retrieved from http://hdl.handle.net/1920/8920

Not specified: Masters Thesis or Doctoral Dissertation

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

Zhou, Xi. “Revealed Path Choice Behavior and Network Pruning for Efficient Path Finding .” 2014. Thesis, George Mason University. Accessed December 12, 2019. http://hdl.handle.net/1920/8920.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Zhou, Xi. “Revealed Path Choice Behavior and Network Pruning for Efficient Path Finding .” 2014. Web. 12 Dec 2019.

Vancouver:

Zhou X. Revealed Path Choice Behavior and Network Pruning for Efficient Path Finding . [Internet] [Thesis]. George Mason University; 2014. [cited 2019 Dec 12]. Available from: http://hdl.handle.net/1920/8920.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zhou X. Revealed Path Choice Behavior and Network Pruning for Efficient Path Finding . [Thesis]. George Mason University; 2014. Available from: http://hdl.handle.net/1920/8920

Not specified: Masters Thesis or Doctoral Dissertation

7. Touray, Barra. Energy-efficient routing algorithms for wireless sensor networks.

Degree: PhD, 2013, Liverpool John Moores University

URL: http://researchonline.ljmu.ac.uk/id/eprint/4352/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.594282

► A wireless sensor network (WSN) is made of tiny sensor nodes usually deployed in high density within a targeted area to monitor a phenomenon of…
(more)

Subjects/Keywords: 621.382; biased random walk, routing algorithm, clustering, energy efficient, shortest path first, wireless sensor network.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Touray, B. (2013). Energy-efficient routing algorithms for wireless sensor networks. (Doctoral Dissertation). Liverpool John Moores University. Retrieved from http://researchonline.ljmu.ac.uk/id/eprint/4352/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.594282

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

Touray, Barra. “Energy-efficient routing algorithms for wireless sensor networks.” 2013. Doctoral Dissertation, Liverpool John Moores University. Accessed December 12, 2019. http://researchonline.ljmu.ac.uk/id/eprint/4352/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.594282.

MLA Handbook (7^{th} Edition):

Touray, Barra. “Energy-efficient routing algorithms for wireless sensor networks.” 2013. Web. 12 Dec 2019.

Vancouver:

Touray B. Energy-efficient routing algorithms for wireless sensor networks. [Internet] [Doctoral dissertation]. Liverpool John Moores University; 2013. [cited 2019 Dec 12]. Available from: http://researchonline.ljmu.ac.uk/id/eprint/4352/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.594282.

Council of Science Editors:

Touray B. Energy-efficient routing algorithms for wireless sensor networks. [Doctoral Dissertation]. Liverpool John Moores University; 2013. Available from: http://researchonline.ljmu.ac.uk/id/eprint/4352/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.594282

Universiteit Utrecht

8. Bruine, M. de. Applying graph theory for a more consistent estimate of the boundary layer height: Mixing layer height retrieval using ground-based lidar measurements.

Degree: 2014, Universiteit Utrecht

URL: http://dspace.library.uu.nl:8080/handle/1874/299439

► The height of the atmospheric boundary layer, or mixing layer (MLH) is an important parameter for understanding the dynamics of the atmosphere and dispersion of…
(more)

Subjects/Keywords: mixing layer; mixing layer height; atmospheric boundary layer; lidar; ceilometer; backscatter; graph theory; Dijkstra's algorithm; shortest path algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bruine, M. d. (2014). Applying graph theory for a more consistent estimate of the boundary layer height: Mixing layer height retrieval using ground-based lidar measurements. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/299439

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

Bruine, M de. “Applying graph theory for a more consistent estimate of the boundary layer height: Mixing layer height retrieval using ground-based lidar measurements.” 2014. Masters Thesis, Universiteit Utrecht. Accessed December 12, 2019. http://dspace.library.uu.nl:8080/handle/1874/299439.

MLA Handbook (7^{th} Edition):

Bruine, M de. “Applying graph theory for a more consistent estimate of the boundary layer height: Mixing layer height retrieval using ground-based lidar measurements.” 2014. Web. 12 Dec 2019.

Vancouver:

Bruine Md. Applying graph theory for a more consistent estimate of the boundary layer height: Mixing layer height retrieval using ground-based lidar measurements. [Internet] [Masters thesis]. Universiteit Utrecht; 2014. [cited 2019 Dec 12]. Available from: http://dspace.library.uu.nl:8080/handle/1874/299439.

Council of Science Editors:

Bruine Md. Applying graph theory for a more consistent estimate of the boundary layer height: Mixing layer height retrieval using ground-based lidar measurements. [Masters Thesis]. Universiteit Utrecht; 2014. Available from: http://dspace.library.uu.nl:8080/handle/1874/299439

NSYSU

9.
Chen, Ming-You.
Efficient Algorithms for Computing *Shortest* *Path* on Directed and Undirected Double-Loop Networks.

Degree: Master, Computer Science and Engineering, 2003, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0825103-160926

► In this thesis, we present two e cent algorithms to compute *shortest* *path* between pair of vertices in directed and undirected double-loop networks. The *algorithm*…
(more)

Subjects/Keywords: Routing Algorithm; Shortest Path; Double Loop Networks

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Chen, M. (2003). Efficient Algorithms for Computing Shortest Path on Directed and Undirected Double-Loop Networks. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0825103-160926

Not specified: Masters Thesis or Doctoral Dissertation

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

Chen, Ming-You. “Efficient Algorithms for Computing Shortest Path on Directed and Undirected Double-Loop Networks.” 2003. Thesis, NSYSU. Accessed December 12, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0825103-160926.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Chen, Ming-You. “Efficient Algorithms for Computing Shortest Path on Directed and Undirected Double-Loop Networks.” 2003. Web. 12 Dec 2019.

Vancouver:

Chen M. Efficient Algorithms for Computing Shortest Path on Directed and Undirected Double-Loop Networks. [Internet] [Thesis]. NSYSU; 2003. [cited 2019 Dec 12]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0825103-160926.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chen M. Efficient Algorithms for Computing Shortest Path on Directed and Undirected Double-Loop Networks. [Thesis]. NSYSU; 2003. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0825103-160926

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

10.
Lim, Heechul.
Evaluation of *Shortest* *Path* Query *Algorithm* in Spatial Databases.

Degree: 2003, University of Waterloo

URL: http://hdl.handle.net/10012/1085

► Many variations of algorithms for finding the *shortest* *path* in a large graph have been introduced recently due to the needs of applications like the…
(more)

Subjects/Keywords: Computer Science; Shortest Path Query; Spatial Database; Pruning Algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lim, H. (2003). Evaluation of Shortest Path Query Algorithm in Spatial Databases. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/1085

Not specified: Masters Thesis or Doctoral Dissertation

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

Lim, Heechul. “Evaluation of Shortest Path Query Algorithm in Spatial Databases.” 2003. Thesis, University of Waterloo. Accessed December 12, 2019. http://hdl.handle.net/10012/1085.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Lim, Heechul. “Evaluation of Shortest Path Query Algorithm in Spatial Databases.” 2003. Web. 12 Dec 2019.

Vancouver:

Lim H. Evaluation of Shortest Path Query Algorithm in Spatial Databases. [Internet] [Thesis]. University of Waterloo; 2003. [cited 2019 Dec 12]. Available from: http://hdl.handle.net/10012/1085.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lim H. Evaluation of Shortest Path Query Algorithm in Spatial Databases. [Thesis]. University of Waterloo; 2003. Available from: http://hdl.handle.net/10012/1085

Not specified: Masters Thesis or Doctoral Dissertation

11.
Nagubadi, RadhaKrishna.
K *Shortest* *Path* Implementation.

Degree: The Institute of Technology, 2013, Linköping UniversityLinköping University

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-95451

► The problem of computing K *shortest* loopless paths, or ranking of the K *shortest* loopless paths between a pair of given vertices in a…
(more)

Subjects/Keywords: K Shortest Path; Yen's; Shortest Path Algorithm; Deviation paths; K shortest loopless paths

…13
3.2
K *SHORTEST* *PATH* *ALGORITHM*… …12
FIGURE 3.2: BEST *PATH* *ALGORITHM* *PATH* FINDING TO DETERMINE KTH *SHORTEST* *PATH*… …covers the working
method of Best *Path* *Algorithm* which determines the *shortest* *path* and the K… …*Shortest* *Path*
*Algorithm* which determines the K *shortest* paths.
Chapter 4
This chapter explains a… …*Algorithm* and K *Shortest* *Path* *Algorithm*. Moreover, this chapter provides the worstcase analysis of…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Nagubadi, R. (2013). K Shortest Path Implementation. (Thesis). Linköping UniversityLinköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-95451

Not specified: Masters Thesis or Doctoral Dissertation

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

Nagubadi, RadhaKrishna. “K Shortest Path Implementation.” 2013. Thesis, Linköping UniversityLinköping University. Accessed December 12, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-95451.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Nagubadi, RadhaKrishna. “K Shortest Path Implementation.” 2013. Web. 12 Dec 2019.

Vancouver:

Nagubadi R. K Shortest Path Implementation. [Internet] [Thesis]. Linköping UniversityLinköping University; 2013. [cited 2019 Dec 12]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-95451.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Nagubadi R. K Shortest Path Implementation. [Thesis]. Linköping UniversityLinköping University; 2013. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-95451

Not specified: Masters Thesis or Doctoral Dissertation

12. Sato, Brandon. Higher Wireless Connection Capacity Route Selection Algorithms for Automobiles Traveling Between Two Points.

Degree: MS, Computer Science (Arts and Sciences), 2014, University of Miami

URL: https://scholarlyrepository.miami.edu/oa_theses/535

► A GPS system selects routes between two points with minimum physical distance or minimum driving time. Here we address a different type of route…
(more)

Subjects/Keywords: algorithm; shortest path; bounded maximum length path; communication capacity

…3.2
Modified Dijkstra’s *Shortest* *Path* *Algorithm* for Selecting Maximum
Wireless Connection… …Capacity *Shortest* *Path*
3.3
. . . . . . . . . . . . .
11
Modified Dijkstra’s *Algorithm* for… …is to a *shortest* *path*, the higher the penalty value. The
*algorithm* selects among unexplored… …version of Dijkstra’s *shortest* *path* *algorithm* from [5] is presented
in Section 3.1… …This *algorithm* finds a *shortest* *path* with maximum communication
capacity and is used as a…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sato, B. (2014). Higher Wireless Connection Capacity Route Selection Algorithms for Automobiles Traveling Between Two Points. (Thesis). University of Miami. Retrieved from https://scholarlyrepository.miami.edu/oa_theses/535

Not specified: Masters Thesis or Doctoral Dissertation

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

Sato, Brandon. “Higher Wireless Connection Capacity Route Selection Algorithms for Automobiles Traveling Between Two Points.” 2014. Thesis, University of Miami. Accessed December 12, 2019. https://scholarlyrepository.miami.edu/oa_theses/535.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Sato, Brandon. “Higher Wireless Connection Capacity Route Selection Algorithms for Automobiles Traveling Between Two Points.” 2014. Web. 12 Dec 2019.

Vancouver:

Sato B. Higher Wireless Connection Capacity Route Selection Algorithms for Automobiles Traveling Between Two Points. [Internet] [Thesis]. University of Miami; 2014. [cited 2019 Dec 12]. Available from: https://scholarlyrepository.miami.edu/oa_theses/535.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sato B. Higher Wireless Connection Capacity Route Selection Algorithms for Automobiles Traveling Between Two Points. [Thesis]. University of Miami; 2014. Available from: https://scholarlyrepository.miami.edu/oa_theses/535

Not specified: Masters Thesis or Doctoral Dissertation

Texas A&M University

13. Zou, Le. 3D face recognition with wireless transportation.

Degree: 2009, Texas A&M University

URL: http://hdl.handle.net/1969.1/ETD-TAMU-1448

► In this dissertation, we focus on two related parts of a 3D face recognition system with wireless transportation. In the ?rst part, the core components…
(more)

Subjects/Keywords: Face recognition; Feature extraction; Three-dimensional vision; Digital Image Processing; Image Classification; 3D model; Distributed algorithm; Graph theory; Protocols; Routing; Sensor networks; Shortest path; Topology

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zou, L. (2009). 3D face recognition with wireless transportation. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1448

Not specified: Masters Thesis or Doctoral Dissertation

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

Zou, Le. “3D face recognition with wireless transportation.” 2009. Thesis, Texas A&M University. Accessed December 12, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1448.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Zou, Le. “3D face recognition with wireless transportation.” 2009. Web. 12 Dec 2019.

Vancouver:

Zou L. 3D face recognition with wireless transportation. [Internet] [Thesis]. Texas A&M University; 2009. [cited 2019 Dec 12]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1448.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zou L. 3D face recognition with wireless transportation. [Thesis]. Texas A&M University; 2009. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1448

Not specified: Masters Thesis or Doctoral Dissertation

14. Galpin, Thomas. Fuel minimization of a moving vehicle in suburban traffic.

Degree: MS, 4048, 2012, University of Illinois – Urbana-Champaign

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

► In this thesis we study how a driver could use traffic light information in order to adapt his speed profile to save fuel. The mission…
(more)

Subjects/Keywords: Fuel minimization; optimization; shortest path problem; Dijkstra's algorithm; traffic light

…we use Dijkstra’s *shortest* *path* *algorithm* to discretize our
decision problem. By ”setting… …to a destination node (In reality, Djkstra’s *algorithm* can find the *shortest*
*path* from… …Dijkstra’s *algorithm* to find the *shortest* *path* between the origin and
the destination. The… …fuel consumption
to go from one node to another node. Dijkstra’s *algorithm* finds the *shortest*… …which finds the *shortest* *path* (from a source to every other nodes)
for a graph with…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Galpin, T. (2012). Fuel minimization of a moving vehicle in suburban traffic. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/42238

Not specified: Masters Thesis or Doctoral Dissertation

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

Galpin, Thomas. “Fuel minimization of a moving vehicle in suburban traffic.” 2012. Thesis, University of Illinois – Urbana-Champaign. Accessed December 12, 2019. http://hdl.handle.net/2142/42238.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Galpin, Thomas. “Fuel minimization of a moving vehicle in suburban traffic.” 2012. Web. 12 Dec 2019.

Vancouver:

Galpin T. Fuel minimization of a moving vehicle in suburban traffic. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2012. [cited 2019 Dec 12]. Available from: http://hdl.handle.net/2142/42238.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Galpin T. Fuel minimization of a moving vehicle in suburban traffic. [Thesis]. University of Illinois – Urbana-Champaign; 2012. Available from: http://hdl.handle.net/2142/42238

Not specified: Masters Thesis or Doctoral Dissertation

Brno University of Technology

15. Biloš, Martin. Využití dynamického programování v grafových algoritmech .

Degree: 2019, Brno University of Technology

URL: http://hdl.handle.net/11012/180273

► Tato práce se zabývá grafovými algoritmy, jejich využitím a přínosem optimalizační metody dynamického programování. Tento přínos je předveden uživateli pomocí aplikace. Grafové algoritmy najdou využití…
(more)

Subjects/Keywords: Dynamické programování; C++; gtkmm; optimalizace; graf; nejkratší cesta; obchodní cestující; skrytý markovův model; Viterbiho algoritmus; Dynamic programming; C++; gtkmm; optimalization; graph; shortest path; traveling salesman; hidden markov model; Viterbi algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Biloš, M. (2019). Využití dynamického programování v grafových algoritmech . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/180273

Not specified: Masters Thesis or Doctoral Dissertation

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

Biloš, Martin. “Využití dynamického programování v grafových algoritmech .” 2019. Thesis, Brno University of Technology. Accessed December 12, 2019. http://hdl.handle.net/11012/180273.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Biloš, Martin. “Využití dynamického programování v grafových algoritmech .” 2019. Web. 12 Dec 2019.

Vancouver:

Biloš M. Využití dynamického programování v grafových algoritmech . [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2019 Dec 12]. Available from: http://hdl.handle.net/11012/180273.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Biloš M. Využití dynamického programování v grafových algoritmech . [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/180273

Not specified: Masters Thesis or Doctoral Dissertation

Linköping University

16.
Johansson, David.
An Evaluation of *Shortest* *Path* Algorithms on Real Metropolitan Area Networks.

Degree: Computer and Information Science, 2008, Linköping University

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-17491

► This thesis examines some of the best known algorithms for solving the *shortest* point-to-point *path* problem, and evaluates their performance on real metropolitan area…
(more)

Subjects/Keywords: Shortest path; Least hops path; Dijkstra; Computer networks; Bidirectional algorithm; Heap implementation; Performance; Computer Sciences; Datavetenskap (datalogi)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Johansson, D. (2008). An Evaluation of Shortest Path Algorithms on Real Metropolitan Area Networks. (Thesis). Linköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-17491

Not specified: Masters Thesis or Doctoral Dissertation

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

Johansson, David. “An Evaluation of Shortest Path Algorithms on Real Metropolitan Area Networks.” 2008. Thesis, Linköping University. Accessed December 12, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-17491.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Johansson, David. “An Evaluation of Shortest Path Algorithms on Real Metropolitan Area Networks.” 2008. Web. 12 Dec 2019.

Vancouver:

Johansson D. An Evaluation of Shortest Path Algorithms on Real Metropolitan Area Networks. [Internet] [Thesis]. Linköping University; 2008. [cited 2019 Dec 12]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-17491.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Johansson D. An Evaluation of Shortest Path Algorithms on Real Metropolitan Area Networks. [Thesis]. Linköping University; 2008. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-17491

Not specified: Masters Thesis or Doctoral Dissertation

Brno University of Technology

17. Matulová, Nadežda. Grafy a grafové algoritmy .

Degree: 2009, Brno University of Technology

URL: http://hdl.handle.net/11012/15015

► Práca obsahuje základné uvedenie do teórie grafov s charakteristikou vybraných algoritmov, ktoré sa zameriavajú na riešenie úloh spojených s hladaním najkratšej cesty v grafoch. Objasňuje…
(more)

Subjects/Keywords: teória grafov; algoritmus; graf; cesta; najkratšia cesta; theory of graphs; algorithm; graph; path; the shortest path

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Matulová, N. (2009). Grafy a grafové algoritmy . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/15015

Not specified: Masters Thesis or Doctoral Dissertation

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

Matulová, Nadežda. “Grafy a grafové algoritmy .” 2009. Thesis, Brno University of Technology. Accessed December 12, 2019. http://hdl.handle.net/11012/15015.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Matulová, Nadežda. “Grafy a grafové algoritmy .” 2009. Web. 12 Dec 2019.

Vancouver:

Matulová N. Grafy a grafové algoritmy . [Internet] [Thesis]. Brno University of Technology; 2009. [cited 2019 Dec 12]. Available from: http://hdl.handle.net/11012/15015.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Matulová N. Grafy a grafové algoritmy . [Thesis]. Brno University of Technology; 2009. Available from: http://hdl.handle.net/11012/15015

Not specified: Masters Thesis or Doctoral Dissertation

18. Schaeffer, Satu Elisa. Algorithms for Nonuniform Networks.

Degree: 2006, Helsinki University of Technology

URL: http://lib.tkk.fi/Diss/2006/isbn9512281198/

►

In this thesis, observations on structural properties of natural networks are taken as a starting point for developing efficient algorithms for natural instances of different… (more)

Subjects/Keywords: community structure; graph algorithm; graph clustering; graph data mining; graph similarity; local search; minimum spanning tree; network model; nonuniform network; random graph; random sampling; routing; scale-free network; shortest path algorithm; small-world network

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Schaeffer, S. E. (2006). Algorithms for Nonuniform Networks. (Thesis). Helsinki University of Technology. Retrieved from http://lib.tkk.fi/Diss/2006/isbn9512281198/

Not specified: Masters Thesis or Doctoral Dissertation

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

Schaeffer, Satu Elisa. “Algorithms for Nonuniform Networks.” 2006. Thesis, Helsinki University of Technology. Accessed December 12, 2019. http://lib.tkk.fi/Diss/2006/isbn9512281198/.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Schaeffer, Satu Elisa. “Algorithms for Nonuniform Networks.” 2006. Web. 12 Dec 2019.

Vancouver:

Schaeffer SE. Algorithms for Nonuniform Networks. [Internet] [Thesis]. Helsinki University of Technology; 2006. [cited 2019 Dec 12]. Available from: http://lib.tkk.fi/Diss/2006/isbn9512281198/.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Schaeffer SE. Algorithms for Nonuniform Networks. [Thesis]. Helsinki University of Technology; 2006. Available from: http://lib.tkk.fi/Diss/2006/isbn9512281198/

Not specified: Masters Thesis or Doctoral Dissertation

19. Hertiš, Tadej. Implementacija metod iskanja najkrajše poti za optimizacijo povezovanja v socialnih omrežjih.

Degree: 2018, Univerza v Mariboru

URL: https://dk.um.si/IzpisGradiva.php?id=70968 ; https://dk.um.si/Dokument.php?id=126518&dn= ; https://dk.um.si/Dokument.php?id=126126&dn= ; https://plus.si.cobiss.net/opac7/bib/21587222?lang=sl

►

V magistrskem delu predstavljamo problem iskanja najkrajše poti v socialnih omrežjih na podlagi pregleda, analize in implementacije metod iskanja najkrajše poti. Izdelan je bil sistematičen… (more)

Subjects/Keywords: problem iskanja najkrajše poti; Dijkstrov algoritem; Bellman-Fordov algoritem; socialno omrežje; analiza socialnih omrežij; Shortest path problem; Dijkstra algorithm; Bellman-Ford algorithm; Social network; Social network analysis; info:eu-repo/classification/udc/004.738.021(043.2)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hertiš, T. (2018). Implementacija metod iskanja najkrajše poti za optimizacijo povezovanja v socialnih omrežjih. (Masters Thesis). Univerza v Mariboru. Retrieved from https://dk.um.si/IzpisGradiva.php?id=70968 ; https://dk.um.si/Dokument.php?id=126518&dn= ; https://dk.um.si/Dokument.php?id=126126&dn= ; https://plus.si.cobiss.net/opac7/bib/21587222?lang=sl

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

Hertiš, Tadej. “Implementacija metod iskanja najkrajše poti za optimizacijo povezovanja v socialnih omrežjih.” 2018. Masters Thesis, Univerza v Mariboru. Accessed December 12, 2019. https://dk.um.si/IzpisGradiva.php?id=70968 ; https://dk.um.si/Dokument.php?id=126518&dn= ; https://dk.um.si/Dokument.php?id=126126&dn= ; https://plus.si.cobiss.net/opac7/bib/21587222?lang=sl.

MLA Handbook (7^{th} Edition):

Hertiš, Tadej. “Implementacija metod iskanja najkrajše poti za optimizacijo povezovanja v socialnih omrežjih.” 2018. Web. 12 Dec 2019.

Vancouver:

Hertiš T. Implementacija metod iskanja najkrajše poti za optimizacijo povezovanja v socialnih omrežjih. [Internet] [Masters thesis]. Univerza v Mariboru; 2018. [cited 2019 Dec 12]. Available from: https://dk.um.si/IzpisGradiva.php?id=70968 ; https://dk.um.si/Dokument.php?id=126518&dn= ; https://dk.um.si/Dokument.php?id=126126&dn= ; https://plus.si.cobiss.net/opac7/bib/21587222?lang=sl.

Council of Science Editors:

Hertiš T. Implementacija metod iskanja najkrajše poti za optimizacijo povezovanja v socialnih omrežjih. [Masters Thesis]. Univerza v Mariboru; 2018. Available from: https://dk.um.si/IzpisGradiva.php?id=70968 ; https://dk.um.si/Dokument.php?id=126518&dn= ; https://dk.um.si/Dokument.php?id=126126&dn= ; https://plus.si.cobiss.net/opac7/bib/21587222?lang=sl

Brno University of Technology

20. Kocourek, Jakub. Poradce při nákupech .

Degree: 2010, Brno University of Technology

URL: http://hdl.handle.net/11012/56144

► Tato práce se zabývá problematikou nalezení nejkratší cesty v obchodu pro zvolený nákup. Jsou zde popsány technologie pro tvorbu www stránek. Pro procházení stavového prostoru…
(more)

Subjects/Keywords: Problém obchodního cestujícího; genetický algoritmus; simulované žíhání; nejkratší cesta v grafu; Dijkstrův algoritmus; Bellman-Ford algoritmus; Floyd-Warshall algoritmus; MySQL; PostgreSQL; MS SQL; Oracle; PHP; Java; ASP.NET; Perl; Nette; Javascript; JQuery.; Travelling salesman problem; genetic algorithm; simulated annealing; shortest path problem; Dijkstra's algorithm; Bellman-Ford algorithm; Floyd-Warshall algorithm; MySQL; PostgreSQL; MS SQL; Oracle; PHP; Java; ASP.NET; Perl; Nette; Javascript; JQuery.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kocourek, J. (2010). Poradce při nákupech . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/56144

Not specified: Masters Thesis or Doctoral Dissertation

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

Kocourek, Jakub. “Poradce při nákupech .” 2010. Thesis, Brno University of Technology. Accessed December 12, 2019. http://hdl.handle.net/11012/56144.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kocourek, Jakub. “Poradce při nákupech .” 2010. Web. 12 Dec 2019.

Vancouver:

Kocourek J. Poradce při nákupech . [Internet] [Thesis]. Brno University of Technology; 2010. [cited 2019 Dec 12]. Available from: http://hdl.handle.net/11012/56144.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kocourek J. Poradce při nákupech . [Thesis]. Brno University of Technology; 2010. Available from: http://hdl.handle.net/11012/56144

Not specified: Masters Thesis or Doctoral Dissertation

Brno University of Technology

21. Krauter, Michal. Nejkratší cesty v grafu .

Degree: 2009, Brno University of Technology

URL: http://hdl.handle.net/11012/53883

► Tato práce se zabývá problematikou nejkratších cest v grafu. Hledání těchto cest patří mezi základní problémy teorie grafů s četnými praktickými aplikacemi. Problém hledání nejkratších…
(more)

Subjects/Keywords: Nejkratší cesta; grafový algoritmus; nejkratší cesty mezi všemi vrcholy grafu; Dijkstrův algoritmus; Bellmanův-Fordův algoritmus; Floydův-Warshallův algoritmus.; Shortest paths; graph algorithms; single-source shortest path problem; all-paris shortest path problem; Dijkstra's algorithm; Bellman-Ford's algorithm; Floyd-Warshall's algorithm.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Krauter, M. (2009). Nejkratší cesty v grafu . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/53883

Not specified: Masters Thesis or Doctoral Dissertation

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

Krauter, Michal. “Nejkratší cesty v grafu .” 2009. Thesis, Brno University of Technology. Accessed December 12, 2019. http://hdl.handle.net/11012/53883.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Krauter, Michal. “Nejkratší cesty v grafu .” 2009. Web. 12 Dec 2019.

Vancouver:

Krauter M. Nejkratší cesty v grafu . [Internet] [Thesis]. Brno University of Technology; 2009. [cited 2019 Dec 12]. Available from: http://hdl.handle.net/11012/53883.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Krauter M. Nejkratší cesty v grafu . [Thesis]. Brno University of Technology; 2009. Available from: http://hdl.handle.net/11012/53883

Not specified: Masters Thesis or Doctoral Dissertation

22. Rice, Michael Norris. Algorithms for Constrained Route Planning in Road Networks.

Degree: Computer Science, 2013, University of California – Riverside

URL: http://www.escholarship.org/uc/item/5tv4g78j

► This dissertation examines advanced pre-processing techniques and query algorithms for efficiently solving several practical, real-world route planning problems for personalized navigation in road networks. Unlike…
(more)

Subjects/Keywords: Computer science; Algorithm Engineering; Constraints; Preprocessing; Road Networks; Route Planning; Shortest Path

…by any *shortest*-*path* search *algorithm*
(e.g., Dijkstra’s *algorithm*) to ignore any… …upper bound on the
reach of v. Any *shortest*-*path* search *algorithm* (e.g., Dijkstra’s… …*Shortest* *Path* Queries . . . . . .
5.2.1 Related Work . . . . . . . . . . . . . .
5.2.2 Our… …edges are shown as solid edges whereas E2 edges are shown
as dashed edges. The *shortest* *path*… …x28;e.g., find only a least-cost, or “*shortest*”2 , overall *path*), whereas most…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Rice, M. N. (2013). Algorithms for Constrained Route Planning in Road Networks. (Thesis). University of California – Riverside. Retrieved from http://www.escholarship.org/uc/item/5tv4g78j

Not specified: Masters Thesis or Doctoral Dissertation

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

Rice, Michael Norris. “Algorithms for Constrained Route Planning in Road Networks.” 2013. Thesis, University of California – Riverside. Accessed December 12, 2019. http://www.escholarship.org/uc/item/5tv4g78j.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Rice, Michael Norris. “Algorithms for Constrained Route Planning in Road Networks.” 2013. Web. 12 Dec 2019.

Vancouver:

Rice MN. Algorithms for Constrained Route Planning in Road Networks. [Internet] [Thesis]. University of California – Riverside; 2013. [cited 2019 Dec 12]. Available from: http://www.escholarship.org/uc/item/5tv4g78j.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rice MN. Algorithms for Constrained Route Planning in Road Networks. [Thesis]. University of California – Riverside; 2013. Available from: http://www.escholarship.org/uc/item/5tv4g78j

Not specified: Masters Thesis or Doctoral Dissertation

23.
Ma, Lin.
Modeling *Algorithm* Performance on Highly-threaded Many-core Architectures.

Degree: PhD, Computer Science & Engineering, 2014, Washington University in St. Louis

URL: https://openscholarship.wustl.edu/eng_etds/63

► The rapid growth of data processing required in various arenas of computation over the past decades necessitates extensive use of parallel computing engines. Among…
(more)

Subjects/Keywords: Algorithm Analysis; All-Pairs Shortest Path; GPU; Many-core; Performance Model; TMM; Engineering

…critical-*path* length) — the time taken by the *algorithm* on an infinite number
of processors… …patterns. For example, if we look
11
at two example algorithms for all-pairs *shortest* *path*… …algorithms involved include 4 all-pair *shortest* *path* algorithms (dynamic
programming via a… …also called depth and critical-*path* length) — the time taken by the *algorithm* on an… …Figure 4.4
Figure 4.5
Figure 4.6
Speedup of the dynamic programming *algorithm* for…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ma, L. (2014). Modeling Algorithm Performance on Highly-threaded Many-core Architectures. (Doctoral Dissertation). Washington University in St. Louis. Retrieved from https://openscholarship.wustl.edu/eng_etds/63

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

Ma, Lin. “Modeling Algorithm Performance on Highly-threaded Many-core Architectures.” 2014. Doctoral Dissertation, Washington University in St. Louis. Accessed December 12, 2019. https://openscholarship.wustl.edu/eng_etds/63.

MLA Handbook (7^{th} Edition):

Ma, Lin. “Modeling Algorithm Performance on Highly-threaded Many-core Architectures.” 2014. Web. 12 Dec 2019.

Vancouver:

Ma L. Modeling Algorithm Performance on Highly-threaded Many-core Architectures. [Internet] [Doctoral dissertation]. Washington University in St. Louis; 2014. [cited 2019 Dec 12]. Available from: https://openscholarship.wustl.edu/eng_etds/63.

Council of Science Editors:

Ma L. Modeling Algorithm Performance on Highly-threaded Many-core Architectures. [Doctoral Dissertation]. Washington University in St. Louis; 2014. Available from: https://openscholarship.wustl.edu/eng_etds/63

24. Leite Pinto Secretin, T.A. Design of a Combinatorial Tool for Preliminary Space Mission Analysis, applied to the GTOC2 Problem:.

Degree: 2012, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:a4f63563-0e28-47b7-908c-4a4df1195560

► In recent years, space missions to asteroids have been a focus of research. This type of mission has introduced a new challenge in space mission…
(more)

Subjects/Keywords: mission analysis; asteroid; combinatorial; optimisation; GTOC; greedy algorithm; shortest path problem; differential evolution; tudat

…GTOC2 Combinatorial Model
4.1 Basic Graph Theory . . . . . . . . .
4.2 The *Shortest* *Path*… …Problem . . . . .
4.3 The Dynamic *Shortest* *Path* Problem
4.4 Dynamic to Static Cost Function… …Central Processing Unit
Differential Evolution
Dynamic *Shortest* *Path* Problem
Exact Generalized… …Ascending Node
Root Mean Square
*Shortest* *Path* Problem
*Shortest* *Path* Problem Test Case 1
*Shortest*… …*Path* dimension in Graph Theory
Number of champion paths in the multi-*path* greedy *algorithm*…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Leite Pinto Secretin, T. A. (2012). Design of a Combinatorial Tool for Preliminary Space Mission Analysis, applied to the GTOC2 Problem:. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:a4f63563-0e28-47b7-908c-4a4df1195560

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

Leite Pinto Secretin, T A. “Design of a Combinatorial Tool for Preliminary Space Mission Analysis, applied to the GTOC2 Problem:.” 2012. Masters Thesis, Delft University of Technology. Accessed December 12, 2019. http://resolver.tudelft.nl/uuid:a4f63563-0e28-47b7-908c-4a4df1195560.

MLA Handbook (7^{th} Edition):

Leite Pinto Secretin, T A. “Design of a Combinatorial Tool for Preliminary Space Mission Analysis, applied to the GTOC2 Problem:.” 2012. Web. 12 Dec 2019.

Vancouver:

Leite Pinto Secretin TA. Design of a Combinatorial Tool for Preliminary Space Mission Analysis, applied to the GTOC2 Problem:. [Internet] [Masters thesis]. Delft University of Technology; 2012. [cited 2019 Dec 12]. Available from: http://resolver.tudelft.nl/uuid:a4f63563-0e28-47b7-908c-4a4df1195560.

Council of Science Editors:

Leite Pinto Secretin TA. Design of a Combinatorial Tool for Preliminary Space Mission Analysis, applied to the GTOC2 Problem:. [Masters Thesis]. Delft University of Technology; 2012. Available from: http://resolver.tudelft.nl/uuid:a4f63563-0e28-47b7-908c-4a4df1195560

University of KwaZulu-Natal

25. Ayokunle, Popoola Peter. Discrete particle swarm optimization for combinatorial problems with innovative applications.

Degree: 2016, University of KwaZulu-Natal

URL: http://hdl.handle.net/10413/15510

Abstract available in PDF file.
*Advisors/Committee Members: Adewumi, Aderemi Oluyinka. (advisor), Martins, Arasomwan Akugbe. (advisor).*

Subjects/Keywords: Theses - Computer Science.; Particle swarm optimization.; Swarm Intelligence.; DPSO Algorithm.; Stochastic Shortest Path problem.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ayokunle, P. P. (2016). Discrete particle swarm optimization for combinatorial problems with innovative applications. (Thesis). University of KwaZulu-Natal. Retrieved from http://hdl.handle.net/10413/15510

Not specified: Masters Thesis or Doctoral Dissertation

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

Ayokunle, Popoola Peter. “Discrete particle swarm optimization for combinatorial problems with innovative applications.” 2016. Thesis, University of KwaZulu-Natal. Accessed December 12, 2019. http://hdl.handle.net/10413/15510.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Ayokunle, Popoola Peter. “Discrete particle swarm optimization for combinatorial problems with innovative applications.” 2016. Web. 12 Dec 2019.

Vancouver:

Ayokunle PP. Discrete particle swarm optimization for combinatorial problems with innovative applications. [Internet] [Thesis]. University of KwaZulu-Natal; 2016. [cited 2019 Dec 12]. Available from: http://hdl.handle.net/10413/15510.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ayokunle PP. Discrete particle swarm optimization for combinatorial problems with innovative applications. [Thesis]. University of KwaZulu-Natal; 2016. Available from: http://hdl.handle.net/10413/15510

Not specified: Masters Thesis or Doctoral Dissertation

26. MARIA LINAWATY. Microscopic traffic modeling and simulation.

Degree: 2004, National University of Singapore

URL: http://scholarbank.nus.edu.sg/handle/10635/14251

Subjects/Keywords: microscopic traffic modeling; cellular automata model; two-dimensional traffic simulation; traffic flow; shortest path algorithm; traffic navigation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

LINAWATY, M. (2004). Microscopic traffic modeling and simulation. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/14251

Not specified: Masters Thesis or Doctoral Dissertation

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

LINAWATY, MARIA. “Microscopic traffic modeling and simulation.” 2004. Thesis, National University of Singapore. Accessed December 12, 2019. http://scholarbank.nus.edu.sg/handle/10635/14251.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

LINAWATY, MARIA. “Microscopic traffic modeling and simulation.” 2004. Web. 12 Dec 2019.

Vancouver:

LINAWATY M. Microscopic traffic modeling and simulation. [Internet] [Thesis]. National University of Singapore; 2004. [cited 2019 Dec 12]. Available from: http://scholarbank.nus.edu.sg/handle/10635/14251.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

LINAWATY M. Microscopic traffic modeling and simulation. [Thesis]. National University of Singapore; 2004. Available from: http://scholarbank.nus.edu.sg/handle/10635/14251

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

27. Ward, Paul. A Scalable Partial-Order Data Structure for Distributed-System Observation.

Degree: 2001, University of Waterloo

URL: http://hdl.handle.net/10012/1161

► Distributed-system observation is foundational to understanding and controlling distributed computations. Existing tools for distributed-system observation are constrained in the size of computation that they can…
(more)

Subjects/Keywords: Computer Science; Dijkstra's shortest path algorithms; disk-based algorithm; graph partitioning; divide and conquer; GIS

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ward, P. (2001). A Scalable Partial-Order Data Structure for Distributed-System Observation. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/1161

Not specified: Masters Thesis or Doctoral Dissertation

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

Ward, Paul. “A Scalable Partial-Order Data Structure for Distributed-System Observation.” 2001. Thesis, University of Waterloo. Accessed December 12, 2019. http://hdl.handle.net/10012/1161.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Ward, Paul. “A Scalable Partial-Order Data Structure for Distributed-System Observation.” 2001. Web. 12 Dec 2019.

Vancouver:

Ward P. A Scalable Partial-Order Data Structure for Distributed-System Observation. [Internet] [Thesis]. University of Waterloo; 2001. [cited 2019 Dec 12]. Available from: http://hdl.handle.net/10012/1161.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ward P. A Scalable Partial-Order Data Structure for Distributed-System Observation. [Thesis]. University of Waterloo; 2001. Available from: http://hdl.handle.net/10012/1161

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

28.
Zhang, Ning.
*Shortest**Path* Queries in Very Large Spatial Databases.

Degree: 2001, University of Waterloo

URL: http://hdl.handle.net/10012/1156

► Finding the *shortest* paths in a graph has been studied for a long time, and there are many main memory based algorithms dealing with this…
(more)

Subjects/Keywords: Computer Science; Dijkstra's shortest path algorithms; disk-based algorithm; graph partitioning; divide and conquer; GIS

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zhang, N. (2001). Shortest Path Queries in Very Large Spatial Databases. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/1156

Not specified: Masters Thesis or Doctoral Dissertation

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

Zhang, Ning. “Shortest Path Queries in Very Large Spatial Databases.” 2001. Thesis, University of Waterloo. Accessed December 12, 2019. http://hdl.handle.net/10012/1156.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Zhang, Ning. “Shortest Path Queries in Very Large Spatial Databases.” 2001. Web. 12 Dec 2019.

Vancouver:

Zhang N. Shortest Path Queries in Very Large Spatial Databases. [Internet] [Thesis]. University of Waterloo; 2001. [cited 2019 Dec 12]. Available from: http://hdl.handle.net/10012/1156.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zhang N. Shortest Path Queries in Very Large Spatial Databases. [Thesis]. University of Waterloo; 2001. Available from: http://hdl.handle.net/10012/1156

Not specified: Masters Thesis or Doctoral Dissertation

University of Southern California

29. Akerling, Zeve. Minor embedding for experimental investigation of a quantum annealer.

Degree: MS, Physics, 2015, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/594159/rec/4088

► The D-Wave Quantum Annealer is of interest both for its potential as a quantum information processing platform and as an engineered quantum system for controlled…
(more)

Subjects/Keywords: quantum computing; adiabatic quantum computing; programmable quantum annealing; engineered quantum systems; compiler; Ising model; minor embedding; graph theory; simulated annealing; genetic algorithm; quantum signature Hamiltonian; quantum system identification; decoherence; bipartite; Dijkstra shortest path

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Akerling, Z. (2015). Minor embedding for experimental investigation of a quantum annealer. (Masters Thesis). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/594159/rec/4088

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

Akerling, Zeve. “Minor embedding for experimental investigation of a quantum annealer.” 2015. Masters Thesis, University of Southern California. Accessed December 12, 2019. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/594159/rec/4088.

MLA Handbook (7^{th} Edition):

Akerling, Zeve. “Minor embedding for experimental investigation of a quantum annealer.” 2015. Web. 12 Dec 2019.

Vancouver:

Akerling Z. Minor embedding for experimental investigation of a quantum annealer. [Internet] [Masters thesis]. University of Southern California; 2015. [cited 2019 Dec 12]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/594159/rec/4088.

Council of Science Editors:

Akerling Z. Minor embedding for experimental investigation of a quantum annealer. [Masters Thesis]. University of Southern California; 2015. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/594159/rec/4088

Brno University of Technology

30. Jež, Radek. Navigace poštovního robota .

Degree: 2009, Brno University of Technology

URL: http://hdl.handle.net/11012/2143

► Práce se zabývá řídicími algoritmy pro poštovního robota. Řeší problematiku hledání optimální cesty a možné problémy vzniklé při navigaci robota. Obsahuje popis použitých datových struktur…
(more)

Subjects/Keywords: hledání nejkratší cesty; Dijkstrův algoritmus; graf; čárový kód; shortest path finding; Dijkstra’s algorithm; graphs; bar code

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Jež, R. (2009). Navigace poštovního robota . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/2143

Not specified: Masters Thesis or Doctoral Dissertation

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

Jež, Radek. “Navigace poštovního robota .” 2009. Thesis, Brno University of Technology. Accessed December 12, 2019. http://hdl.handle.net/11012/2143.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Jež, Radek. “Navigace poštovního robota .” 2009. Web. 12 Dec 2019.

Vancouver:

Jež R. Navigace poštovního robota . [Internet] [Thesis]. Brno University of Technology; 2009. [cited 2019 Dec 12]. Available from: http://hdl.handle.net/11012/2143.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Jež R. Navigace poštovního robota . [Thesis]. Brno University of Technology; 2009. Available from: http://hdl.handle.net/11012/2143

Not specified: Masters Thesis or Doctoral Dissertation