Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Routing algorithms). Showing records 1 – 30 of 162 total matches.

[1] [2] [3] [4] [5] [6]

Search Limiters

Last 2 Years | English Only

Levels

Languages

Country

▼ Search Limiters


Jawaharlal Nehru University

1. Ruhil, Anand Prakash. Position based localized routing in mobile ad hoc network; -.

Degree: computer and system science, 2003, Jawaharlal Nehru University

Advances in wireless technology and hand-held computing devices have brollght newlinerevolution in the area of mobile communication. The increasing mobility of humans newlineacross the globe… (more)

Subjects/Keywords:

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ruhil, A. P. (2003). Position based localized routing in mobile ad hoc network; -. (Thesis). Jawaharlal Nehru University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/15892

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Ruhil, Anand Prakash. “Position based localized routing in mobile ad hoc network; -.” 2003. Thesis, Jawaharlal Nehru University. Accessed June 18, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/15892.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Ruhil, Anand Prakash. “Position based localized routing in mobile ad hoc network; -.” 2003. Web. 18 Jun 2019.

Vancouver:

Ruhil AP. Position based localized routing in mobile ad hoc network; -. [Internet] [Thesis]. Jawaharlal Nehru University; 2003. [cited 2019 Jun 18]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/15892.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ruhil AP. Position based localized routing in mobile ad hoc network; -. [Thesis]. Jawaharlal Nehru University; 2003. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/15892

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Hong Kong University of Science and Technology

2. Xu, Liangyu. A heuristic algorithm for the multi-period vehicle routing problem with simultaneous pickup and delivery service.

Degree: 2010, Hong Kong University of Science and Technology

 Many companies have a central depot to store raw materials and finished products. There are many factories located around the central depot. Each factory has… (more)

Subjects/Keywords: Vehicle routing problem  – Mathematical models; Heuristic algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xu, L. (2010). A heuristic algorithm for the multi-period vehicle routing problem with simultaneous pickup and delivery service. (Thesis). Hong Kong University of Science and Technology. Retrieved from https://doi.org/10.14711/thesis-b1115896 ; http://repository.ust.hk/ir/bitstream/1783.1-7061/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Xu, Liangyu. “A heuristic algorithm for the multi-period vehicle routing problem with simultaneous pickup and delivery service.” 2010. Thesis, Hong Kong University of Science and Technology. Accessed June 18, 2019. https://doi.org/10.14711/thesis-b1115896 ; http://repository.ust.hk/ir/bitstream/1783.1-7061/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Xu, Liangyu. “A heuristic algorithm for the multi-period vehicle routing problem with simultaneous pickup and delivery service.” 2010. Web. 18 Jun 2019.

Vancouver:

Xu L. A heuristic algorithm for the multi-period vehicle routing problem with simultaneous pickup and delivery service. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2010. [cited 2019 Jun 18]. Available from: https://doi.org/10.14711/thesis-b1115896 ; http://repository.ust.hk/ir/bitstream/1783.1-7061/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Xu L. A heuristic algorithm for the multi-period vehicle routing problem with simultaneous pickup and delivery service. [Thesis]. Hong Kong University of Science and Technology; 2010. Available from: https://doi.org/10.14711/thesis-b1115896 ; http://repository.ust.hk/ir/bitstream/1783.1-7061/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Carnegie Mellon University

3. Dinitz, Michael. Algorithms and Models for Problems in Networking.

Degree: 2010, Carnegie Mellon University

 Many interesting theoretical problems arise from computer networks. In this thesis we will consider three of them: algorithms and data structures for problems involving distances… (more)

Subjects/Keywords: Algorithms; Networking; Spanners; Routing; Wireless; Capacity; BGP

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dinitz, M. (2010). Algorithms and Models for Problems in Networking. (Thesis). Carnegie Mellon University. Retrieved from http://repository.cmu.edu/dissertations/9

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Dinitz, Michael. “Algorithms and Models for Problems in Networking.” 2010. Thesis, Carnegie Mellon University. Accessed June 18, 2019. http://repository.cmu.edu/dissertations/9.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Dinitz, Michael. “Algorithms and Models for Problems in Networking.” 2010. Web. 18 Jun 2019.

Vancouver:

Dinitz M. Algorithms and Models for Problems in Networking. [Internet] [Thesis]. Carnegie Mellon University; 2010. [cited 2019 Jun 18]. Available from: http://repository.cmu.edu/dissertations/9.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Dinitz M. Algorithms and Models for Problems in Networking. [Thesis]. Carnegie Mellon University; 2010. Available from: http://repository.cmu.edu/dissertations/9

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

4. Almodóvar Chico, J.L. A study of demand oblivious routing algorithms:.

Degree: 2012, Delft University of Technology

 Nowadays, people make use of communication networks (e.g. Internet) everyday and expect high quality from the offered services. Providing a good quality of service and… (more)

Subjects/Keywords: oblivious routing; routing algorithms

routing 2.1 Routing algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2.2… …Oblivious routing algorithms 3.1 Introduction . . . . . . . . . . . . . . . 3.2 The network model… …literature and studies about oblivious routing based their work. The most representative algorithms… …routing 2.1 Routing algorithms The main purpose of a communication network is to carry… …parameters, but not all the existing routing algorithms consider the same information at the time… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Almodóvar Chico, J. L. (2012). A study of demand oblivious routing algorithms:. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:94f1baf3-5fb5-4a5e-98c6-8c50fbc0ef4b

Chicago Manual of Style (16th Edition):

Almodóvar Chico, J L. “A study of demand oblivious routing algorithms:.” 2012. Masters Thesis, Delft University of Technology. Accessed June 18, 2019. http://resolver.tudelft.nl/uuid:94f1baf3-5fb5-4a5e-98c6-8c50fbc0ef4b.

MLA Handbook (7th Edition):

Almodóvar Chico, J L. “A study of demand oblivious routing algorithms:.” 2012. Web. 18 Jun 2019.

Vancouver:

Almodóvar Chico JL. A study of demand oblivious routing algorithms:. [Internet] [Masters thesis]. Delft University of Technology; 2012. [cited 2019 Jun 18]. Available from: http://resolver.tudelft.nl/uuid:94f1baf3-5fb5-4a5e-98c6-8c50fbc0ef4b.

Council of Science Editors:

Almodóvar Chico JL. A study of demand oblivious routing algorithms:. [Masters Thesis]. Delft University of Technology; 2012. Available from: http://resolver.tudelft.nl/uuid:94f1baf3-5fb5-4a5e-98c6-8c50fbc0ef4b


University of Texas – Austin

5. Enderle, Justin Wayne. A routing architecture for delay tolerant networks.

Degree: Electrical and Computer Engineering, 2011, University of Texas – Austin

 As the field of Delay Tolerant Networking continues to expand and receive more attention, a new class of routing algorithms have been proposed that are… (more)

Subjects/Keywords: Delay tolerant networking; Routing architecture; Network simulation; DTN; Routing algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Enderle, J. W. (2011). A routing architecture for delay tolerant networks. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2011-05-3075

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Enderle, Justin Wayne. “A routing architecture for delay tolerant networks.” 2011. Thesis, University of Texas – Austin. Accessed June 18, 2019. http://hdl.handle.net/2152/ETD-UT-2011-05-3075.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Enderle, Justin Wayne. “A routing architecture for delay tolerant networks.” 2011. Web. 18 Jun 2019.

Vancouver:

Enderle JW. A routing architecture for delay tolerant networks. [Internet] [Thesis]. University of Texas – Austin; 2011. [cited 2019 Jun 18]. Available from: http://hdl.handle.net/2152/ETD-UT-2011-05-3075.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Enderle JW. A routing architecture for delay tolerant networks. [Thesis]. University of Texas – Austin; 2011. Available from: http://hdl.handle.net/2152/ETD-UT-2011-05-3075

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Bradford

6. Mohammad, Abdulbaset H. T. Localised routing algorithms in communication networks with Quality of Service constraints : performance evaluation and enhancement of new localised routing approaches to provide Quality of Service for computer and communication networks.

Degree: PhD, 2010, University of Bradford

 The Quality of Service (QoS) is a profound concept which is gaining increasing attention in the Internet industry. Best-effort applications are now no longer acceptable… (more)

Subjects/Keywords: 621.382; Localised quality of service routing; Performance evaluation; Routing algorithms; Quality of Service (QoS); Scalability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mohammad, A. H. T. (2010). Localised routing algorithms in communication networks with Quality of Service constraints : performance evaluation and enhancement of new localised routing approaches to provide Quality of Service for computer and communication networks. (Doctoral Dissertation). University of Bradford. Retrieved from http://hdl.handle.net/10454/5163

Chicago Manual of Style (16th Edition):

Mohammad, Abdulbaset H T. “Localised routing algorithms in communication networks with Quality of Service constraints : performance evaluation and enhancement of new localised routing approaches to provide Quality of Service for computer and communication networks.” 2010. Doctoral Dissertation, University of Bradford. Accessed June 18, 2019. http://hdl.handle.net/10454/5163.

MLA Handbook (7th Edition):

Mohammad, Abdulbaset H T. “Localised routing algorithms in communication networks with Quality of Service constraints : performance evaluation and enhancement of new localised routing approaches to provide Quality of Service for computer and communication networks.” 2010. Web. 18 Jun 2019.

Vancouver:

Mohammad AHT. Localised routing algorithms in communication networks with Quality of Service constraints : performance evaluation and enhancement of new localised routing approaches to provide Quality of Service for computer and communication networks. [Internet] [Doctoral dissertation]. University of Bradford; 2010. [cited 2019 Jun 18]. Available from: http://hdl.handle.net/10454/5163.

Council of Science Editors:

Mohammad AHT. Localised routing algorithms in communication networks with Quality of Service constraints : performance evaluation and enhancement of new localised routing approaches to provide Quality of Service for computer and communication networks. [Doctoral Dissertation]. University of Bradford; 2010. Available from: http://hdl.handle.net/10454/5163


University of Bradford

7. Li, Ding. Localised routing algorithms with Quality of Service constraints : development and performance evaluation by simulation of new localised Quality of Service routing algorithms for communication networks using residual bandwidth and mean end-to-end delay as metrics.

Degree: 2010, University of Bradford

 Localised QoS routing is a relatively new, alternative and viable approach to solve the problems of traditional QoS routing algorithms which use global state information… (more)

Subjects/Keywords: 621.382; QoS routing; Quality of Service (QoS); Localised routing; Algorithms; Bandwidth; Mean delay; Simulation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, D. (2010). Localised routing algorithms with Quality of Service constraints : development and performance evaluation by simulation of new localised Quality of Service routing algorithms for communication networks using residual bandwidth and mean end-to-end delay as metrics. (Doctoral Dissertation). University of Bradford. Retrieved from http://hdl.handle.net/10454/4912

Chicago Manual of Style (16th Edition):

Li, Ding. “Localised routing algorithms with Quality of Service constraints : development and performance evaluation by simulation of new localised Quality of Service routing algorithms for communication networks using residual bandwidth and mean end-to-end delay as metrics.” 2010. Doctoral Dissertation, University of Bradford. Accessed June 18, 2019. http://hdl.handle.net/10454/4912.

MLA Handbook (7th Edition):

Li, Ding. “Localised routing algorithms with Quality of Service constraints : development and performance evaluation by simulation of new localised Quality of Service routing algorithms for communication networks using residual bandwidth and mean end-to-end delay as metrics.” 2010. Web. 18 Jun 2019.

Vancouver:

Li D. Localised routing algorithms with Quality of Service constraints : development and performance evaluation by simulation of new localised Quality of Service routing algorithms for communication networks using residual bandwidth and mean end-to-end delay as metrics. [Internet] [Doctoral dissertation]. University of Bradford; 2010. [cited 2019 Jun 18]. Available from: http://hdl.handle.net/10454/4912.

Council of Science Editors:

Li D. Localised routing algorithms with Quality of Service constraints : development and performance evaluation by simulation of new localised Quality of Service routing algorithms for communication networks using residual bandwidth and mean end-to-end delay as metrics. [Doctoral Dissertation]. University of Bradford; 2010. Available from: http://hdl.handle.net/10454/4912


Univerzitet u Beogradu

8. Kojić, Nenad, 1977-. Primena neuralnih mreža u rešavanju transportnih problema.

Degree: Elektrotehnički fakultet, 2013, Univerzitet u Beogradu

Elektrotehničko i računarsko inženjerstvo - Neuralne mreže / Electrical and computer engineering - Neural Networks

Dvadeseti vek je obeležen ekspanzijom u razvoju, priozvodnji i primeni… (more)

Subjects/Keywords: Artificial neural networks; Hopfield neural networks; routing algorithms; multicast routing; routing and wavelength assignment; route selection problems; multicriteria optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kojić, Nenad, 1. (2013). Primena neuralnih mreža u rešavanju transportnih problema. (Thesis). Univerzitet u Beogradu. Retrieved from https://fedorabg.bg.ac.rs/fedora/get/o:5502/bdef:Content/get

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Kojić, Nenad, 1977-. “Primena neuralnih mreža u rešavanju transportnih problema.” 2013. Thesis, Univerzitet u Beogradu. Accessed June 18, 2019. https://fedorabg.bg.ac.rs/fedora/get/o:5502/bdef:Content/get.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Kojić, Nenad, 1977-. “Primena neuralnih mreža u rešavanju transportnih problema.” 2013. Web. 18 Jun 2019.

Vancouver:

Kojić, Nenad 1. Primena neuralnih mreža u rešavanju transportnih problema. [Internet] [Thesis]. Univerzitet u Beogradu; 2013. [cited 2019 Jun 18]. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:5502/bdef:Content/get.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kojić, Nenad 1. Primena neuralnih mreža u rešavanju transportnih problema. [Thesis]. Univerzitet u Beogradu; 2013. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:5502/bdef:Content/get

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Bradford

9. Aldosari, Fahd M. New quality of service routing algorithms based on local state information : the development and performance evaluation of new bandwidth-constrained and delay-constrained quality of service routing algorithms based on localized routing strategies.

Degree: PhD, 2011, University of Bradford

 The exponential growth of Internet applications has created new challenges for the control and administration of large-scale networks, which consist of heterogeneous elements under dynamically… (more)

Subjects/Keywords: 004.6; Internet; Network traffic; Quality of Service (QoS) framework; Communication networks; QoS routing algorithms; Routing performance; Localized routing; OMNet++; IntServ; DiffServ

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Aldosari, F. M. (2011). New quality of service routing algorithms based on local state information : the development and performance evaluation of new bandwidth-constrained and delay-constrained quality of service routing algorithms based on localized routing strategies. (Doctoral Dissertation). University of Bradford. Retrieved from http://hdl.handle.net/10454/5406

Chicago Manual of Style (16th Edition):

Aldosari, Fahd M. “New quality of service routing algorithms based on local state information : the development and performance evaluation of new bandwidth-constrained and delay-constrained quality of service routing algorithms based on localized routing strategies.” 2011. Doctoral Dissertation, University of Bradford. Accessed June 18, 2019. http://hdl.handle.net/10454/5406.

MLA Handbook (7th Edition):

Aldosari, Fahd M. “New quality of service routing algorithms based on local state information : the development and performance evaluation of new bandwidth-constrained and delay-constrained quality of service routing algorithms based on localized routing strategies.” 2011. Web. 18 Jun 2019.

Vancouver:

Aldosari FM. New quality of service routing algorithms based on local state information : the development and performance evaluation of new bandwidth-constrained and delay-constrained quality of service routing algorithms based on localized routing strategies. [Internet] [Doctoral dissertation]. University of Bradford; 2011. [cited 2019 Jun 18]. Available from: http://hdl.handle.net/10454/5406.

Council of Science Editors:

Aldosari FM. New quality of service routing algorithms based on local state information : the development and performance evaluation of new bandwidth-constrained and delay-constrained quality of service routing algorithms based on localized routing strategies. [Doctoral Dissertation]. University of Bradford; 2011. Available from: http://hdl.handle.net/10454/5406


University of Cambridge

10. Daggitt, Matthew Lucian. An algebraic perspective on the convergence of vector-based routing protocols .

Degree: 2019, University of Cambridge

 This thesis studies the properties of vector-based routing protocols whose underlying algebras are strictly increasing. Strict increasingness has previously been shown to be both a… (more)

Subjects/Keywords: Routing protocols; Agda; Asynchronous iterations; Parallel algorithms; Formal verification; Algebra; Convergence; Vector-based routing; Path-vector; Distance-vector; Routing; BGP; RIP

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Daggitt, M. L. (2019). An algebraic perspective on the convergence of vector-based routing protocols . (Thesis). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/292067

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Daggitt, Matthew Lucian. “An algebraic perspective on the convergence of vector-based routing protocols .” 2019. Thesis, University of Cambridge. Accessed June 18, 2019. https://www.repository.cam.ac.uk/handle/1810/292067.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Daggitt, Matthew Lucian. “An algebraic perspective on the convergence of vector-based routing protocols .” 2019. Web. 18 Jun 2019.

Vancouver:

Daggitt ML. An algebraic perspective on the convergence of vector-based routing protocols . [Internet] [Thesis]. University of Cambridge; 2019. [cited 2019 Jun 18]. Available from: https://www.repository.cam.ac.uk/handle/1810/292067.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Daggitt ML. An algebraic perspective on the convergence of vector-based routing protocols . [Thesis]. University of Cambridge; 2019. Available from: https://www.repository.cam.ac.uk/handle/1810/292067

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


McMaster University

11. Hu, Kun. Using Reputation in Repeated Selfish Routing with Incomplete Information.

Degree: MCS, 2013, McMaster University

We study the application of reputation as an instigator of beneficial user behavior in selfish routing and when the network users rely on the… (more)

Subjects/Keywords: Selfish Routing; Repeated Game; Incomplete Information; Reputation; Theory and Algorithms; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hu, K. (2013). Using Reputation in Repeated Selfish Routing with Incomplete Information. (Masters Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/13009

Chicago Manual of Style (16th Edition):

Hu, Kun. “Using Reputation in Repeated Selfish Routing with Incomplete Information.” 2013. Masters Thesis, McMaster University. Accessed June 18, 2019. http://hdl.handle.net/11375/13009.

MLA Handbook (7th Edition):

Hu, Kun. “Using Reputation in Repeated Selfish Routing with Incomplete Information.” 2013. Web. 18 Jun 2019.

Vancouver:

Hu K. Using Reputation in Repeated Selfish Routing with Incomplete Information. [Internet] [Masters thesis]. McMaster University; 2013. [cited 2019 Jun 18]. Available from: http://hdl.handle.net/11375/13009.

Council of Science Editors:

Hu K. Using Reputation in Repeated Selfish Routing with Incomplete Information. [Masters Thesis]. McMaster University; 2013. Available from: http://hdl.handle.net/11375/13009

12. Reina, Caio Domingues. Roteirização de veículos com janelas de tempo utilizando algoritmo genético.

Degree: Mestrado, Engenharia de Transportes, 2012, University of São Paulo

O componente de planejamento faz parte do projeto de desenvolvimento dos veículos autônomos, e é responsável por gerar rotas para o sistema como um todo.… (more)

Subjects/Keywords: Algoritmos genéticos; Genetic algorithms; Road transport; Roteirização; Routing; Transporte rodoviário

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Reina, C. D. (2012). Roteirização de veículos com janelas de tempo utilizando algoritmo genético. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/3/3138/tde-06062013-162636/ ;

Chicago Manual of Style (16th Edition):

Reina, Caio Domingues. “Roteirização de veículos com janelas de tempo utilizando algoritmo genético.” 2012. Masters Thesis, University of São Paulo. Accessed June 18, 2019. http://www.teses.usp.br/teses/disponiveis/3/3138/tde-06062013-162636/ ;.

MLA Handbook (7th Edition):

Reina, Caio Domingues. “Roteirização de veículos com janelas de tempo utilizando algoritmo genético.” 2012. Web. 18 Jun 2019.

Vancouver:

Reina CD. Roteirização de veículos com janelas de tempo utilizando algoritmo genético. [Internet] [Masters thesis]. University of São Paulo; 2012. [cited 2019 Jun 18]. Available from: http://www.teses.usp.br/teses/disponiveis/3/3138/tde-06062013-162636/ ;.

Council of Science Editors:

Reina CD. Roteirização de veículos com janelas de tempo utilizando algoritmo genético. [Masters Thesis]. University of São Paulo; 2012. Available from: http://www.teses.usp.br/teses/disponiveis/3/3138/tde-06062013-162636/ ;


University of Alberta

13. Jorati, Amin. Approximation Algorithms for some Min-max Vehicle Routing Problems.

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

 In this thesis, we consider min-max vehicle routing problems, specifically min-max tour cover and star cover problems. Given a metric (V,c) and a number k,… (more)

Subjects/Keywords: Star Cover; Vehicle Routing; Approximation Algorithms; Tour Cover

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jorati, A. (2013). Approximation Algorithms for some Min-max Vehicle Routing Problems. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/1v53jz385

Chicago Manual of Style (16th Edition):

Jorati, Amin. “Approximation Algorithms for some Min-max Vehicle Routing Problems.” 2013. Masters Thesis, University of Alberta. Accessed June 18, 2019. https://era.library.ualberta.ca/files/1v53jz385.

MLA Handbook (7th Edition):

Jorati, Amin. “Approximation Algorithms for some Min-max Vehicle Routing Problems.” 2013. Web. 18 Jun 2019.

Vancouver:

Jorati A. Approximation Algorithms for some Min-max Vehicle Routing Problems. [Internet] [Masters thesis]. University of Alberta; 2013. [cited 2019 Jun 18]. Available from: https://era.library.ualberta.ca/files/1v53jz385.

Council of Science Editors:

Jorati A. Approximation Algorithms for some Min-max Vehicle Routing Problems. [Masters Thesis]. University of Alberta; 2013. Available from: https://era.library.ualberta.ca/files/1v53jz385


Anna University

14. Bhagyaveni, M A. Studies on novel routing algorithms for mobile ad hoc network; -.

Degree: Information and Communication Engineering, 2014, Anna University

Ad hoc networks are gaining increasing popularity in recent years newlinebecause of their ease of deployment No wired base station or infrastructure is newlinesupported and… (more)

Subjects/Keywords: information and communication engineering; mobile ad hoc network; novel routing algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bhagyaveni, M. A. (2014). Studies on novel routing algorithms for mobile ad hoc network; -. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/27477

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Bhagyaveni, M A. “Studies on novel routing algorithms for mobile ad hoc network; -.” 2014. Thesis, Anna University. Accessed June 18, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/27477.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Bhagyaveni, M A. “Studies on novel routing algorithms for mobile ad hoc network; -.” 2014. Web. 18 Jun 2019.

Vancouver:

Bhagyaveni MA. Studies on novel routing algorithms for mobile ad hoc network; -. [Internet] [Thesis]. Anna University; 2014. [cited 2019 Jun 18]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/27477.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bhagyaveni MA. Studies on novel routing algorithms for mobile ad hoc network; -. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/27477

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Anna University

15. Siva kumar D. A study and implementation of ant based routing algorithms for mobile ad hoc networks;.

Degree: A study and implementation of ant based routing algorithms for mobile ad hoc networks, 2015, Anna University

In recent years mobile computing and wireless networks have newlineenjoyed a tremendous rise in popularity and technological advancemen The newlinedesign of smaller and more powerful… (more)

Subjects/Keywords: ad hoc networks; information and communication engineering; routing algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

D, S. k. (2015). A study and implementation of ant based routing algorithms for mobile ad hoc networks;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/34213

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

D, Siva kumar. “A study and implementation of ant based routing algorithms for mobile ad hoc networks;.” 2015. Thesis, Anna University. Accessed June 18, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/34213.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

D, Siva kumar. “A study and implementation of ant based routing algorithms for mobile ad hoc networks;.” 2015. Web. 18 Jun 2019.

Vancouver:

D Sk. A study and implementation of ant based routing algorithms for mobile ad hoc networks;. [Internet] [Thesis]. Anna University; 2015. [cited 2019 Jun 18]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/34213.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

D Sk. A study and implementation of ant based routing algorithms for mobile ad hoc networks;. [Thesis]. Anna University; 2015. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/34213

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Portland State University

16. Parashar, Neha. Design Space Analysis and a Novel Routing Agorithm for Unstructured Networks-on-Chip.

Degree: MS(M.S.) in Electrical and Computer Engineering, Electrical and Computer Engineering, 2010, Portland State University

  Traditionally, on-chip network communication was achieved with shared medium networks where devices shared the transmission medium with only one device driving the network at… (more)

Subjects/Keywords: Networks on a chip; Computer algorithms; Routing (Computer network management)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Parashar, N. (2010). Design Space Analysis and a Novel Routing Agorithm for Unstructured Networks-on-Chip. (Masters Thesis). Portland State University. Retrieved from https://pdxscholar.library.pdx.edu/open_access_etds/89

Chicago Manual of Style (16th Edition):

Parashar, Neha. “Design Space Analysis and a Novel Routing Agorithm for Unstructured Networks-on-Chip.” 2010. Masters Thesis, Portland State University. Accessed June 18, 2019. https://pdxscholar.library.pdx.edu/open_access_etds/89.

MLA Handbook (7th Edition):

Parashar, Neha. “Design Space Analysis and a Novel Routing Agorithm for Unstructured Networks-on-Chip.” 2010. Web. 18 Jun 2019.

Vancouver:

Parashar N. Design Space Analysis and a Novel Routing Agorithm for Unstructured Networks-on-Chip. [Internet] [Masters thesis]. Portland State University; 2010. [cited 2019 Jun 18]. Available from: https://pdxscholar.library.pdx.edu/open_access_etds/89.

Council of Science Editors:

Parashar N. Design Space Analysis and a Novel Routing Agorithm for Unstructured Networks-on-Chip. [Masters Thesis]. Portland State University; 2010. Available from: https://pdxscholar.library.pdx.edu/open_access_etds/89

17. Παπαδόπoυλος, Χαράλαμπoς. Συγκριτική μελέτη της απόδοσης αλγορίθμων δρομολόγησης αυτοοργανούμενων δικτύων.

Degree: 2011, University of Patras

Στα αυτοοργανούμενα ασύρματα δίκτυα, αυτόνομοι κόμβοι με κάρτες ασύρματης μετάδοσης σχηματίζουν ένα δίκτυο χωρίς προϋπάρχουσα δομή. Η δρομολόγηση σε ένα συμβατικό δίκτυο γίνεται από ειδικούς… (more)

Subjects/Keywords: Αλγόριθμοι δρομολόγησης; Αυτοοργανούμενα ασύρματα δίκτυα; Routing algorithms; Ad hoc wireless networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Παπαδόπoυλος, . (2011). Συγκριτική μελέτη της απόδοσης αλγορίθμων δρομολόγησης αυτοοργανούμενων δικτύων. (Masters Thesis). University of Patras. Retrieved from http://hdl.handle.net/10889/5433

Chicago Manual of Style (16th Edition):

Παπαδόπoυλος, Χαράλαμπoς. “Συγκριτική μελέτη της απόδοσης αλγορίθμων δρομολόγησης αυτοοργανούμενων δικτύων.” 2011. Masters Thesis, University of Patras. Accessed June 18, 2019. http://hdl.handle.net/10889/5433.

MLA Handbook (7th Edition):

Παπαδόπoυλος, Χαράλαμπoς. “Συγκριτική μελέτη της απόδοσης αλγορίθμων δρομολόγησης αυτοοργανούμενων δικτύων.” 2011. Web. 18 Jun 2019.

Vancouver:

Παπαδόπoυλος . Συγκριτική μελέτη της απόδοσης αλγορίθμων δρομολόγησης αυτοοργανούμενων δικτύων. [Internet] [Masters thesis]. University of Patras; 2011. [cited 2019 Jun 18]. Available from: http://hdl.handle.net/10889/5433.

Council of Science Editors:

Παπαδόπoυλος . Συγκριτική μελέτη της απόδοσης αλγορίθμων δρομολόγησης αυτοοργανούμενων δικτύων. [Masters Thesis]. University of Patras; 2011. Available from: http://hdl.handle.net/10889/5433

18. Paturu Raghunatha Rao, Nityananda Suresh. Path Planning under Failures in Wireless Sensor Networks.

Degree: MS, Computer Science, 2013, North Dakota State University

 This paper explores how an all pair shortest path can be obtained in a wireless sensor network when sensors fail. Sensors are randomly deployed in… (more)

Subjects/Keywords: Wireless sensor networks.; Routing (Computer network management); Computer algorithms.; Sensor networks.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Paturu Raghunatha Rao, N. S. (2013). Path Planning under Failures in Wireless Sensor Networks. (Masters Thesis). North Dakota State University. Retrieved from http://hdl.handle.net/10365/22971

Chicago Manual of Style (16th Edition):

Paturu Raghunatha Rao, Nityananda Suresh. “Path Planning under Failures in Wireless Sensor Networks.” 2013. Masters Thesis, North Dakota State University. Accessed June 18, 2019. http://hdl.handle.net/10365/22971.

MLA Handbook (7th Edition):

Paturu Raghunatha Rao, Nityananda Suresh. “Path Planning under Failures in Wireless Sensor Networks.” 2013. Web. 18 Jun 2019.

Vancouver:

Paturu Raghunatha Rao NS. Path Planning under Failures in Wireless Sensor Networks. [Internet] [Masters thesis]. North Dakota State University; 2013. [cited 2019 Jun 18]. Available from: http://hdl.handle.net/10365/22971.

Council of Science Editors:

Paturu Raghunatha Rao NS. Path Planning under Failures in Wireless Sensor Networks. [Masters Thesis]. North Dakota State University; 2013. Available from: http://hdl.handle.net/10365/22971


University of Waterloo

19. Nicholson, Patrick. The application of the in-tree knapsack problem to routing prefix caches.

Degree: 2009, University of Waterloo

 Modern routers use specialized hardware, such as Ternary Content Addressable Memory (TCAM), to solve the Longest Prefix Matching Problem (LPMP) quickly. Due to the fact… (more)

Subjects/Keywords: tree knapsack problem; routing prefix caching; approximation algorithms; dynamic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nicholson, P. (2009). The application of the in-tree knapsack problem to routing prefix caches. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/4364

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Nicholson, Patrick. “The application of the in-tree knapsack problem to routing prefix caches.” 2009. Thesis, University of Waterloo. Accessed June 18, 2019. http://hdl.handle.net/10012/4364.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Nicholson, Patrick. “The application of the in-tree knapsack problem to routing prefix caches.” 2009. Web. 18 Jun 2019.

Vancouver:

Nicholson P. The application of the in-tree knapsack problem to routing prefix caches. [Internet] [Thesis]. University of Waterloo; 2009. [cited 2019 Jun 18]. Available from: http://hdl.handle.net/10012/4364.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Nicholson P. The application of the in-tree knapsack problem to routing prefix caches. [Thesis]. University of Waterloo; 2009. Available from: http://hdl.handle.net/10012/4364

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Curtin University of Technology

20. Chong, Yen N. Heuristic algorithms for routing problems.

Degree: 2001, Curtin University of Technology

 General routing problems deal with transporting some commodities and/or travelling along the axes of a given network in some optimal manner. In the modern world… (more)

Subjects/Keywords: heuristic algorithms; routing problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chong, Y. N. (2001). Heuristic algorithms for routing problems. (Thesis). Curtin University of Technology. Retrieved from http://hdl.handle.net/20.500.11937/1090

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Chong, Yen N. “Heuristic algorithms for routing problems. ” 2001. Thesis, Curtin University of Technology. Accessed June 18, 2019. http://hdl.handle.net/20.500.11937/1090.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Chong, Yen N. “Heuristic algorithms for routing problems. ” 2001. Web. 18 Jun 2019.

Vancouver:

Chong YN. Heuristic algorithms for routing problems. [Internet] [Thesis]. Curtin University of Technology; 2001. [cited 2019 Jun 18]. Available from: http://hdl.handle.net/20.500.11937/1090.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chong YN. Heuristic algorithms for routing problems. [Thesis]. Curtin University of Technology; 2001. Available from: http://hdl.handle.net/20.500.11937/1090

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Cornell University

21. Steele, Patrick Robert. Vehicle Routing Problems .

Degree: 2017, Cornell University

 In this dissertation we consider variants of the vehicle routing problem applied to two problem areas. First, we consider the problem of scheduling deliveries from… (more)

Subjects/Keywords: Vehicle routing problems; Operations research; Competitive algorithms; Simulation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Steele, P. R. (2017). Vehicle Routing Problems . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/47797

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Steele, Patrick Robert. “Vehicle Routing Problems .” 2017. Thesis, Cornell University. Accessed June 18, 2019. http://hdl.handle.net/1813/47797.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Steele, Patrick Robert. “Vehicle Routing Problems .” 2017. Web. 18 Jun 2019.

Vancouver:

Steele PR. Vehicle Routing Problems . [Internet] [Thesis]. Cornell University; 2017. [cited 2019 Jun 18]. Available from: http://hdl.handle.net/1813/47797.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Steele PR. Vehicle Routing Problems . [Thesis]. Cornell University; 2017. Available from: http://hdl.handle.net/1813/47797

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Arizona

22. Ahuja, Sandeep Kour. ALGORITHMS FOR ROUTING AND CHANNEL ASSIGNMENT IN WIRELESS INFRASTRUCTURE NETWORKS .

Degree: 2010, University of Arizona

 Wireless communication is a rapidly growing segment of the communication industry, with the potential to provide low-cost, high-quality, and high-speed information exchange between portable devices.… (more)

Subjects/Keywords: Algorithms; Channel Assignment; Graph Coloring; Graph throey; Routing; Wireless Networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ahuja, S. K. (2010). ALGORITHMS FOR ROUTING AND CHANNEL ASSIGNMENT IN WIRELESS INFRASTRUCTURE NETWORKS . (Doctoral Dissertation). University of Arizona. Retrieved from http://hdl.handle.net/10150/195190

Chicago Manual of Style (16th Edition):

Ahuja, Sandeep Kour. “ALGORITHMS FOR ROUTING AND CHANNEL ASSIGNMENT IN WIRELESS INFRASTRUCTURE NETWORKS .” 2010. Doctoral Dissertation, University of Arizona. Accessed June 18, 2019. http://hdl.handle.net/10150/195190.

MLA Handbook (7th Edition):

Ahuja, Sandeep Kour. “ALGORITHMS FOR ROUTING AND CHANNEL ASSIGNMENT IN WIRELESS INFRASTRUCTURE NETWORKS .” 2010. Web. 18 Jun 2019.

Vancouver:

Ahuja SK. ALGORITHMS FOR ROUTING AND CHANNEL ASSIGNMENT IN WIRELESS INFRASTRUCTURE NETWORKS . [Internet] [Doctoral dissertation]. University of Arizona; 2010. [cited 2019 Jun 18]. Available from: http://hdl.handle.net/10150/195190.

Council of Science Editors:

Ahuja SK. ALGORITHMS FOR ROUTING AND CHANNEL ASSIGNMENT IN WIRELESS INFRASTRUCTURE NETWORKS . [Doctoral Dissertation]. University of Arizona; 2010. Available from: http://hdl.handle.net/10150/195190


University of Bradford

23. Alghamdi, Turki A. Novel localised quality of service routing algorithms : performance evaluation of some new localised quality of service routing algorithms based on bandwidth and delay as the metrics for candidate path selection.

Degree: PhD, 2010, University of Bradford

 The growing demand on the variety of internet applications requires management of large scale networks by efficient Quality of Service (QoS) routing, which considerably contributes… (more)

Subjects/Keywords: 621.382; Quality of Service routing algorithms; Performance evaluation; Bandwidth; Delay; Internet applications; Quality of Service (QoS); Localised QoS routing; Scalability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Alghamdi, T. A. (2010). Novel localised quality of service routing algorithms : performance evaluation of some new localised quality of service routing algorithms based on bandwidth and delay as the metrics for candidate path selection. (Doctoral Dissertation). University of Bradford. Retrieved from http://hdl.handle.net/10454/5420

Chicago Manual of Style (16th Edition):

Alghamdi, Turki A. “Novel localised quality of service routing algorithms : performance evaluation of some new localised quality of service routing algorithms based on bandwidth and delay as the metrics for candidate path selection.” 2010. Doctoral Dissertation, University of Bradford. Accessed June 18, 2019. http://hdl.handle.net/10454/5420.

MLA Handbook (7th Edition):

Alghamdi, Turki A. “Novel localised quality of service routing algorithms : performance evaluation of some new localised quality of service routing algorithms based on bandwidth and delay as the metrics for candidate path selection.” 2010. Web. 18 Jun 2019.

Vancouver:

Alghamdi TA. Novel localised quality of service routing algorithms : performance evaluation of some new localised quality of service routing algorithms based on bandwidth and delay as the metrics for candidate path selection. [Internet] [Doctoral dissertation]. University of Bradford; 2010. [cited 2019 Jun 18]. Available from: http://hdl.handle.net/10454/5420.

Council of Science Editors:

Alghamdi TA. Novel localised quality of service routing algorithms : performance evaluation of some new localised quality of service routing algorithms based on bandwidth and delay as the metrics for candidate path selection. [Doctoral Dissertation]. University of Bradford; 2010. Available from: http://hdl.handle.net/10454/5420

24. Preetha K G; Dr. A Unnikrishnan. Design, Development and Evaluation of Efficient Routing Algorithms for Mobile Ad hoc Network.

Degree: 2017, Cochin University of Science and Technology

Subjects/Keywords: MANET; MANET Routing Algorithms; Routing Performance of MANET

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Unnikrishnan, P. K. G. D. A. (2017). Design, Development and Evaluation of Efficient Routing Algorithms for Mobile Ad hoc Network. (Thesis). Cochin University of Science and Technology. Retrieved from http://dyuthi.cusat.ac.in/purl/5283

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Unnikrishnan, Preetha K G; Dr. A. “Design, Development and Evaluation of Efficient Routing Algorithms for Mobile Ad hoc Network.” 2017. Thesis, Cochin University of Science and Technology. Accessed June 18, 2019. http://dyuthi.cusat.ac.in/purl/5283.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Unnikrishnan, Preetha K G; Dr. A. “Design, Development and Evaluation of Efficient Routing Algorithms for Mobile Ad hoc Network.” 2017. Web. 18 Jun 2019.

Vancouver:

Unnikrishnan PKGDA. Design, Development and Evaluation of Efficient Routing Algorithms for Mobile Ad hoc Network. [Internet] [Thesis]. Cochin University of Science and Technology; 2017. [cited 2019 Jun 18]. Available from: http://dyuthi.cusat.ac.in/purl/5283.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Unnikrishnan PKGDA. Design, Development and Evaluation of Efficient Routing Algorithms for Mobile Ad hoc Network. [Thesis]. Cochin University of Science and Technology; 2017. Available from: http://dyuthi.cusat.ac.in/purl/5283

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Indian Institute of Science

25. Praveen Kumar, M. Potential-Based Routing In Wireless Sensor Networks.

Degree: 2008, Indian Institute of Science

 Recent advances in VLSI technology, and wireless communication have enabled the development of tiny, low-cost sensor nodes that communicate over short distances. These sensor nodes,… (more)

Subjects/Keywords: Wireless Sensor Networks (WSNs); Potential-based Routing Approach; Network Partition; Data Fusion; Energy Conservation; Routing; Packet Delivery Ratio; Routing Algorithms; Connectivity-aware Routing; Reliable Routing; Potential Function; Sensor Networks; Reliable-aware Routing; Communication Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Praveen Kumar, M. (2008). Potential-Based Routing In Wireless Sensor Networks. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/767

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Praveen Kumar, M. “Potential-Based Routing In Wireless Sensor Networks.” 2008. Thesis, Indian Institute of Science. Accessed June 18, 2019. http://hdl.handle.net/2005/767.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Praveen Kumar, M. “Potential-Based Routing In Wireless Sensor Networks.” 2008. Web. 18 Jun 2019.

Vancouver:

Praveen Kumar M. Potential-Based Routing In Wireless Sensor Networks. [Internet] [Thesis]. Indian Institute of Science; 2008. [cited 2019 Jun 18]. Available from: http://hdl.handle.net/2005/767.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Praveen Kumar M. Potential-Based Routing In Wireless Sensor Networks. [Thesis]. Indian Institute of Science; 2008. Available from: http://hdl.handle.net/2005/767

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Bath

26. Ba Surra, Shadi Saleh Ali. Collision guided routing for ad hoc mobile wireless networks.

Degree: PhD, 2013, University of Bath

 Ad hoc mobile wireless networks are self-configuring infrastructureless networks of mobile devices connected via wireless links. Each device can send and receive data, but it… (more)

Subjects/Keywords: 681.3845; manet; wmn; clustering algorithms; ad hoc networks; bradcasting; routing; wireless mesh networks; intelligent rebreoadcast algorithms; parallel collision guidance bradcasting; path discovery and social-aware routing protocol

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ba Surra, S. S. A. (2013). Collision guided routing for ad hoc mobile wireless networks. (Doctoral Dissertation). University of Bath. Retrieved from https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.577735

Chicago Manual of Style (16th Edition):

Ba Surra, Shadi Saleh Ali. “Collision guided routing for ad hoc mobile wireless networks.” 2013. Doctoral Dissertation, University of Bath. Accessed June 18, 2019. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.577735.

MLA Handbook (7th Edition):

Ba Surra, Shadi Saleh Ali. “Collision guided routing for ad hoc mobile wireless networks.” 2013. Web. 18 Jun 2019.

Vancouver:

Ba Surra SSA. Collision guided routing for ad hoc mobile wireless networks. [Internet] [Doctoral dissertation]. University of Bath; 2013. [cited 2019 Jun 18]. Available from: https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.577735.

Council of Science Editors:

Ba Surra SSA. Collision guided routing for ad hoc mobile wireless networks. [Doctoral Dissertation]. University of Bath; 2013. Available from: https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.577735


Universidade do Rio Grande do Sul

27. Dickow, Victor Hugo. Avaliação de algoritmos de roteamento e escalonamento de mensagens para redes WirelessHART.

Degree: 2014, Universidade do Rio Grande do Sul

A aplicação de redes sem fio vem crescendo consideravelmente nos últimos anos. Protocolos baseados nesta tecnologia estão sendo desenvolvidos para uma grande variedade de aplicações.… (more)

Subjects/Keywords: Redes sem fio; WirelessHART protocol; Redes de computadores; Routing algorithms; Algoritmos; Scheduling algorithms; Industrial wireless networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dickow, V. H. (2014). Avaliação de algoritmos de roteamento e escalonamento de mensagens para redes WirelessHART. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/97235

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Dickow, Victor Hugo. “Avaliação de algoritmos de roteamento e escalonamento de mensagens para redes WirelessHART.” 2014. Thesis, Universidade do Rio Grande do Sul. Accessed June 18, 2019. http://hdl.handle.net/10183/97235.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Dickow, Victor Hugo. “Avaliação de algoritmos de roteamento e escalonamento de mensagens para redes WirelessHART.” 2014. Web. 18 Jun 2019.

Vancouver:

Dickow VH. Avaliação de algoritmos de roteamento e escalonamento de mensagens para redes WirelessHART. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2014. [cited 2019 Jun 18]. Available from: http://hdl.handle.net/10183/97235.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Dickow VH. Avaliação de algoritmos de roteamento e escalonamento de mensagens para redes WirelessHART. [Thesis]. Universidade do Rio Grande do Sul; 2014. Available from: http://hdl.handle.net/10183/97235

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

28. Mayster, Yan B. Minimax and Maximin Fitting of Geometric Objects to Sets of Points.

Degree: PhD, Computer Science, 2011, U of Denver

  This thesis addresses several problems in the facility location sub-area of computational geometry. Let S be a set of n points in the plane.… (more)

Subjects/Keywords: Approximation algorithms; Computational geometry; Facility location; Pattern recognition; Routing; Algebraic Geometry; Computer Sciences; Mathematics; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mayster, Y. B. (2011). Minimax and Maximin Fitting of Geometric Objects to Sets of Points. (Doctoral Dissertation). U of Denver. Retrieved from https://digitalcommons.du.edu/etd/412

Chicago Manual of Style (16th Edition):

Mayster, Yan B. “Minimax and Maximin Fitting of Geometric Objects to Sets of Points.” 2011. Doctoral Dissertation, U of Denver. Accessed June 18, 2019. https://digitalcommons.du.edu/etd/412.

MLA Handbook (7th Edition):

Mayster, Yan B. “Minimax and Maximin Fitting of Geometric Objects to Sets of Points.” 2011. Web. 18 Jun 2019.

Vancouver:

Mayster YB. Minimax and Maximin Fitting of Geometric Objects to Sets of Points. [Internet] [Doctoral dissertation]. U of Denver; 2011. [cited 2019 Jun 18]. Available from: https://digitalcommons.du.edu/etd/412.

Council of Science Editors:

Mayster YB. Minimax and Maximin Fitting of Geometric Objects to Sets of Points. [Doctoral Dissertation]. U of Denver; 2011. Available from: https://digitalcommons.du.edu/etd/412


University of Florida

29. Arulselvan, Ashwin. Network Models For Disaster Management.

Degree: PhD, Industrial and Systems Engineering, 2009, University of Florida

 We propose network models to study applications related to risk control and disaster management. We also perform a detailed complexity analysis and provide solution approaches… (more)

Subjects/Keywords: Algorithms; Emergency evacuations; Flow graphs; Genetic algorithms; Heuristics; Modeling; Objective functions; Optimal solutions; Simulations; Transportation; connectivity, contraflow, disaster, evacuation, networks, routing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Arulselvan, A. (2009). Network Models For Disaster Management. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0024855

Chicago Manual of Style (16th Edition):

Arulselvan, Ashwin. “Network Models For Disaster Management.” 2009. Doctoral Dissertation, University of Florida. Accessed June 18, 2019. http://ufdc.ufl.edu/UFE0024855.

MLA Handbook (7th Edition):

Arulselvan, Ashwin. “Network Models For Disaster Management.” 2009. Web. 18 Jun 2019.

Vancouver:

Arulselvan A. Network Models For Disaster Management. [Internet] [Doctoral dissertation]. University of Florida; 2009. [cited 2019 Jun 18]. Available from: http://ufdc.ufl.edu/UFE0024855.

Council of Science Editors:

Arulselvan A. Network Models For Disaster Management. [Doctoral Dissertation]. University of Florida; 2009. Available from: http://ufdc.ufl.edu/UFE0024855

30. Hedenström, Marcus. A Complete Customer-to-Customer Shipment Scheduling Module Solving the CVRPTW and MSTPP problems.

Degree: 2012, Chalmers University of Technology

 We implement a module for scheduling orders within a transportation network, considering both a pickup route between customers and a terminal,and the transportation between terminals.… (more)

Subjects/Keywords: MSTPP; steepest descent/greedy algorithm; k shortest paths; vehicle routing; CVRPTW; Genetic algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hedenström, M. (2012). A Complete Customer-to-Customer Shipment Scheduling Module Solving the CVRPTW and MSTPP problems. (Thesis). Chalmers University of Technology. Retrieved from http://studentarbeten.chalmers.se/publication/157435-a-complete-customer-to-customer-shipment-scheduling-module-solving-the-cvrptw-and-mstpp-problems

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Hedenström, Marcus. “A Complete Customer-to-Customer Shipment Scheduling Module Solving the CVRPTW and MSTPP problems.” 2012. Thesis, Chalmers University of Technology. Accessed June 18, 2019. http://studentarbeten.chalmers.se/publication/157435-a-complete-customer-to-customer-shipment-scheduling-module-solving-the-cvrptw-and-mstpp-problems.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Hedenström, Marcus. “A Complete Customer-to-Customer Shipment Scheduling Module Solving the CVRPTW and MSTPP problems.” 2012. Web. 18 Jun 2019.

Vancouver:

Hedenström M. A Complete Customer-to-Customer Shipment Scheduling Module Solving the CVRPTW and MSTPP problems. [Internet] [Thesis]. Chalmers University of Technology; 2012. [cited 2019 Jun 18]. Available from: http://studentarbeten.chalmers.se/publication/157435-a-complete-customer-to-customer-shipment-scheduling-module-solving-the-cvrptw-and-mstpp-problems.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hedenström M. A Complete Customer-to-Customer Shipment Scheduling Module Solving the CVRPTW and MSTPP problems. [Thesis]. Chalmers University of Technology; 2012. Available from: http://studentarbeten.chalmers.se/publication/157435-a-complete-customer-to-customer-shipment-scheduling-module-solving-the-cvrptw-and-mstpp-problems

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

[1] [2] [3] [4] [5] [6]

.