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

Dept: Computer Engineering

You searched for subject:( Suffix tree algorithm). Showing records 1 – 30 of 36 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

Country

▼ Search Limiters

1. Hossain, Mohammad Forhad. Spanning Tree Approach On The Snow Cleaning Problem.

Degree: Computer Engineering, 2010, Dalarna University

  Snow cleaning is one of the important tasks in the winter time in Sweden. Every year government spends huge amount money for snow cleaning… (more)

Subjects/Keywords: Snow Cleaning; Minimum Spanning Tree; Heuristic; prim’s algorithm; Greedy Algorithm.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hossain, M. F. (2010). Spanning Tree Approach On The Snow Cleaning Problem. (Thesis). Dalarna University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:du-4847

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):

Hossain, Mohammad Forhad. “Spanning Tree Approach On The Snow Cleaning Problem.” 2010. Thesis, Dalarna University. Accessed October 18, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:du-4847.

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

MLA Handbook (7th Edition):

Hossain, Mohammad Forhad. “Spanning Tree Approach On The Snow Cleaning Problem.” 2010. Web. 18 Oct 2019.

Vancouver:

Hossain MF. Spanning Tree Approach On The Snow Cleaning Problem. [Internet] [Thesis]. Dalarna University; 2010. [cited 2019 Oct 18]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:du-4847.

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

Council of Science Editors:

Hossain MF. Spanning Tree Approach On The Snow Cleaning Problem. [Thesis]. Dalarna University; 2010. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:du-4847

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

2. Chohan, Ossam. University Scheduling using Genetic Algorithm.

Degree: Computer Engineering, 2009, Dalarna University

  The automated timetabling and scheduling is one of the hardest problem areas. This isbecause of constraints and satisfying those constraints to get the feasible… (more)

Subjects/Keywords: timetabling; genetic algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chohan, O. (2009). University Scheduling using Genetic Algorithm. (Thesis). Dalarna University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:du-3791

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):

Chohan, Ossam. “University Scheduling using Genetic Algorithm.” 2009. Thesis, Dalarna University. Accessed October 18, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:du-3791.

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

MLA Handbook (7th Edition):

Chohan, Ossam. “University Scheduling using Genetic Algorithm.” 2009. Web. 18 Oct 2019.

Vancouver:

Chohan O. University Scheduling using Genetic Algorithm. [Internet] [Thesis]. Dalarna University; 2009. [cited 2019 Oct 18]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:du-3791.

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

Council of Science Editors:

Chohan O. University Scheduling using Genetic Algorithm. [Thesis]. Dalarna University; 2009. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:du-3791

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


Rochester Institute of Technology

3. Liu, Ziyang. Renewable Energy-Aware Routing in the Internet.

Degree: MS, Computer Engineering, 2017, Rochester Institute of Technology

  The increasing power consumption of the Internet infrastructure has attracted a lot of world-wide attention because of the severe impact on the environment. Many… (more)

Subjects/Keywords: BGP; Renewable energy; Routing algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, Z. (2017). Renewable Energy-Aware Routing in the Internet. (Masters Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/9661

Chicago Manual of Style (16th Edition):

Liu, Ziyang. “Renewable Energy-Aware Routing in the Internet.” 2017. Masters Thesis, Rochester Institute of Technology. Accessed October 18, 2019. https://scholarworks.rit.edu/theses/9661.

MLA Handbook (7th Edition):

Liu, Ziyang. “Renewable Energy-Aware Routing in the Internet.” 2017. Web. 18 Oct 2019.

Vancouver:

Liu Z. Renewable Energy-Aware Routing in the Internet. [Internet] [Masters thesis]. Rochester Institute of Technology; 2017. [cited 2019 Oct 18]. Available from: https://scholarworks.rit.edu/theses/9661.

Council of Science Editors:

Liu Z. Renewable Energy-Aware Routing in the Internet. [Masters Thesis]. Rochester Institute of Technology; 2017. Available from: https://scholarworks.rit.edu/theses/9661


Rochester Institute of Technology

4. Schorr, Aric. Performance analysis of a scalable hardware FPGA Skein implementation.

Degree: Computer Engineering, 2010, Rochester Institute of Technology

 Hashing functions are a key cryptographic primitive used in many everyday applications, such as authentication, ensuring data integrity, as well as digital signatures. The current… (more)

Subjects/Keywords: Cryptography; Fpga; Hash; Hashing; Skein; Tree

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Schorr, A. (2010). Performance analysis of a scalable hardware FPGA Skein implementation. (Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/3216

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):

Schorr, Aric. “Performance analysis of a scalable hardware FPGA Skein implementation.” 2010. Thesis, Rochester Institute of Technology. Accessed October 18, 2019. https://scholarworks.rit.edu/theses/3216.

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

MLA Handbook (7th Edition):

Schorr, Aric. “Performance analysis of a scalable hardware FPGA Skein implementation.” 2010. Web. 18 Oct 2019.

Vancouver:

Schorr A. Performance analysis of a scalable hardware FPGA Skein implementation. [Internet] [Thesis]. Rochester Institute of Technology; 2010. [cited 2019 Oct 18]. Available from: https://scholarworks.rit.edu/theses/3216.

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

Council of Science Editors:

Schorr A. Performance analysis of a scalable hardware FPGA Skein implementation. [Thesis]. Rochester Institute of Technology; 2010. Available from: https://scholarworks.rit.edu/theses/3216

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


Clemson University

5. Soundararaj, Vivekgautham. TailoredRE: A Personalized Cloud-based Traffic Redundancy Elimination for Smartphones.

Degree: MS, Computer Engineering, 2016, Clemson University

 The exceptional rise in usages of mobile devices such as smartphones and tablets has contributed to a massive increase in wireless network trac both Cellular… (more)

Subjects/Keywords: Algorithm; Cloud; Data; Networks; Redundancy; Traffic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Soundararaj, V. (2016). TailoredRE: A Personalized Cloud-based Traffic Redundancy Elimination for Smartphones. (Masters Thesis). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_theses/2387

Chicago Manual of Style (16th Edition):

Soundararaj, Vivekgautham. “TailoredRE: A Personalized Cloud-based Traffic Redundancy Elimination for Smartphones.” 2016. Masters Thesis, Clemson University. Accessed October 18, 2019. https://tigerprints.clemson.edu/all_theses/2387.

MLA Handbook (7th Edition):

Soundararaj, Vivekgautham. “TailoredRE: A Personalized Cloud-based Traffic Redundancy Elimination for Smartphones.” 2016. Web. 18 Oct 2019.

Vancouver:

Soundararaj V. TailoredRE: A Personalized Cloud-based Traffic Redundancy Elimination for Smartphones. [Internet] [Masters thesis]. Clemson University; 2016. [cited 2019 Oct 18]. Available from: https://tigerprints.clemson.edu/all_theses/2387.

Council of Science Editors:

Soundararaj V. TailoredRE: A Personalized Cloud-based Traffic Redundancy Elimination for Smartphones. [Masters Thesis]. Clemson University; 2016. Available from: https://tigerprints.clemson.edu/all_theses/2387

6. Lowden, Jason Michael. Analysis of KECCAK Tree Hashing on GPU Architectures.

Degree: MS, Computer Engineering, 2014, Rochester Institute of Technology

  In an effort to provide security and data integrity, hashing algorithms have been designed to consume an input of any length to produce a… (more)

Subjects/Keywords: Crytography; GPU; Tree hashing

…4.1.1 CPU Sequential Implementations . 4.1.2 CPU SSE2 Tree Hashing . . . . . . 4.1.3 GPU-Based… …SSE2 Tree Implementation Performance [6] . . . Tree Hash Mode Performance Results… …x5B;27] . . . . GPU Tree Hashing Results [13] . . . . . . . . . CPU… …Ideal Tree Hashing Operating Points . . . . . . . . . . . . . . . . . . Relative Performance… …Kernel Launches Kernel Throughput for Fixed Tree Height . . . . . . . . . . . . . . . Compute… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lowden, J. M. (2014). Analysis of KECCAK Tree Hashing on GPU Architectures. (Masters Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/8312

Chicago Manual of Style (16th Edition):

Lowden, Jason Michael. “Analysis of KECCAK Tree Hashing on GPU Architectures.” 2014. Masters Thesis, Rochester Institute of Technology. Accessed October 18, 2019. https://scholarworks.rit.edu/theses/8312.

MLA Handbook (7th Edition):

Lowden, Jason Michael. “Analysis of KECCAK Tree Hashing on GPU Architectures.” 2014. Web. 18 Oct 2019.

Vancouver:

Lowden JM. Analysis of KECCAK Tree Hashing on GPU Architectures. [Internet] [Masters thesis]. Rochester Institute of Technology; 2014. [cited 2019 Oct 18]. Available from: https://scholarworks.rit.edu/theses/8312.

Council of Science Editors:

Lowden JM. Analysis of KECCAK Tree Hashing on GPU Architectures. [Masters Thesis]. Rochester Institute of Technology; 2014. Available from: https://scholarworks.rit.edu/theses/8312

7. Tester, Andrew Ryan. Untrusted memory authentication using hash tree engine.

Degree: MS, Computer Engineering, 2015, California State University – Sacramento

 In this project a hardware Hash Tree Engine (HTE) embedded within a secure processor is modeled and simulated that verifies the authenticity of untrusted memory… (more)

Subjects/Keywords: Secure execution; Merkle tree; Verilog

…4-ary Merkle Hash Tree ................................................................ 3… …Figure 2. Hash Tree Example Using XOR as the Hash Function… …15 Figure 9. Partial Hash Tree Representation – Part 1… …18 Figure 10. Partial Hash Tree Representation – Part 2… …memory by parsing a Merkle Hash Tree. 2 1.1 Merkle Hash Tree A Merkel Hash Tree uses a tree… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tester, A. R. (2015). Untrusted memory authentication using hash tree engine. (Masters Thesis). California State University – Sacramento. Retrieved from http://hdl.handle.net/10211.3/139362

Chicago Manual of Style (16th Edition):

Tester, Andrew Ryan. “Untrusted memory authentication using hash tree engine.” 2015. Masters Thesis, California State University – Sacramento. Accessed October 18, 2019. http://hdl.handle.net/10211.3/139362.

MLA Handbook (7th Edition):

Tester, Andrew Ryan. “Untrusted memory authentication using hash tree engine.” 2015. Web. 18 Oct 2019.

Vancouver:

Tester AR. Untrusted memory authentication using hash tree engine. [Internet] [Masters thesis]. California State University – Sacramento; 2015. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/10211.3/139362.

Council of Science Editors:

Tester AR. Untrusted memory authentication using hash tree engine. [Masters Thesis]. California State University – Sacramento; 2015. Available from: http://hdl.handle.net/10211.3/139362


University of California – Santa Cruz

8. Li, Qian. Towards Efficient Routing to Addresses and Names in Computer Communication Networks.

Degree: Computer Engineering, 2014, University of California – Santa Cruz

 Traditional routing protocols in mobile ad hoc networks (MANET) rely on routing tables which suffer from the scale-free and self-organizing nature of wireless networks. Routing… (more)

Subjects/Keywords: Computer engineering; Distance vectors; Distributed algorithm; Publish-subscribe; Routing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, Q. (2014). Towards Efficient Routing to Addresses and Names in Computer Communication Networks. (Thesis). University of California – Santa Cruz. Retrieved from http://www.escholarship.org/uc/item/46t3m6hn

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):

Li, Qian. “Towards Efficient Routing to Addresses and Names in Computer Communication Networks.” 2014. Thesis, University of California – Santa Cruz. Accessed October 18, 2019. http://www.escholarship.org/uc/item/46t3m6hn.

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

MLA Handbook (7th Edition):

Li, Qian. “Towards Efficient Routing to Addresses and Names in Computer Communication Networks.” 2014. Web. 18 Oct 2019.

Vancouver:

Li Q. Towards Efficient Routing to Addresses and Names in Computer Communication Networks. [Internet] [Thesis]. University of California – Santa Cruz; 2014. [cited 2019 Oct 18]. Available from: http://www.escholarship.org/uc/item/46t3m6hn.

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

Council of Science Editors:

Li Q. Towards Efficient Routing to Addresses and Names in Computer Communication Networks. [Thesis]. University of California – Santa Cruz; 2014. Available from: http://www.escholarship.org/uc/item/46t3m6hn

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


Linköping University

9. Carlsson, Erik. Synchronization of Distributed Units without Access to GPS.

Degree: Computer Engineering, 2018, Linköping University

Time synchronization between systems having no external reference can be an issue in small wireless node-based systems. In this thesis a transceiver is designed… (more)

Subjects/Keywords: Timing algorithm; Communications system; QPSK; FPGA; VHDL; Communication Systems; Kommunikationssystem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Carlsson, E. (2018). Synchronization of Distributed Units without Access to GPS. (Thesis). Linköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-149653

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):

Carlsson, Erik. “Synchronization of Distributed Units without Access to GPS.” 2018. Thesis, Linköping University. Accessed October 18, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-149653.

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

MLA Handbook (7th Edition):

Carlsson, Erik. “Synchronization of Distributed Units without Access to GPS.” 2018. Web. 18 Oct 2019.

Vancouver:

Carlsson E. Synchronization of Distributed Units without Access to GPS. [Internet] [Thesis]. Linköping University; 2018. [cited 2019 Oct 18]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-149653.

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

Council of Science Editors:

Carlsson E. Synchronization of Distributed Units without Access to GPS. [Thesis]. Linköping University; 2018. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-149653

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


Rochester Institute of Technology

10. Laskowski, Dieter. Asset protection in a limited swarm environment utilizing artificial potential fields.

Degree: Computer Engineering, 2010, Rochester Institute of Technology

 Asset protection is a behavior in which a team of robots establishes a formation around a resource marked as an asset in a hostile environment… (more)

Subjects/Keywords: Artificial potential fields; Asset protection; Distributed control algorithm; Swarms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Laskowski, D. (2010). Asset protection in a limited swarm environment utilizing artificial potential fields. (Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/5484

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):

Laskowski, Dieter. “Asset protection in a limited swarm environment utilizing artificial potential fields.” 2010. Thesis, Rochester Institute of Technology. Accessed October 18, 2019. https://scholarworks.rit.edu/theses/5484.

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

MLA Handbook (7th Edition):

Laskowski, Dieter. “Asset protection in a limited swarm environment utilizing artificial potential fields.” 2010. Web. 18 Oct 2019.

Vancouver:

Laskowski D. Asset protection in a limited swarm environment utilizing artificial potential fields. [Internet] [Thesis]. Rochester Institute of Technology; 2010. [cited 2019 Oct 18]. Available from: https://scholarworks.rit.edu/theses/5484.

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

Council of Science Editors:

Laskowski D. Asset protection in a limited swarm environment utilizing artificial potential fields. [Thesis]. Rochester Institute of Technology; 2010. Available from: https://scholarworks.rit.edu/theses/5484

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


Rochester Institute of Technology

11. Kelly, Matthew Joseph. Design and Cryptanalysis of a Customizable Authenticated Encryption Algorithm.

Degree: MS, Computer Engineering, 2014, Rochester Institute of Technology

  It is common knowledge that encryption is a useful tool for providing confidentiality. Authentication, however, is often overlooked. Authentication provides data integrity; it helps… (more)

Subjects/Keywords: Algorithm; Authenticated encryption; Cryptography; Duplex construction; Security; Sponge construction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kelly, M. J. (2014). Design and Cryptanalysis of a Customizable Authenticated Encryption Algorithm. (Masters Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/8325

Chicago Manual of Style (16th Edition):

Kelly, Matthew Joseph. “Design and Cryptanalysis of a Customizable Authenticated Encryption Algorithm.” 2014. Masters Thesis, Rochester Institute of Technology. Accessed October 18, 2019. https://scholarworks.rit.edu/theses/8325.

MLA Handbook (7th Edition):

Kelly, Matthew Joseph. “Design and Cryptanalysis of a Customizable Authenticated Encryption Algorithm.” 2014. Web. 18 Oct 2019.

Vancouver:

Kelly MJ. Design and Cryptanalysis of a Customizable Authenticated Encryption Algorithm. [Internet] [Masters thesis]. Rochester Institute of Technology; 2014. [cited 2019 Oct 18]. Available from: https://scholarworks.rit.edu/theses/8325.

Council of Science Editors:

Kelly MJ. Design and Cryptanalysis of a Customizable Authenticated Encryption Algorithm. [Masters Thesis]. Rochester Institute of Technology; 2014. Available from: https://scholarworks.rit.edu/theses/8325


North Carolina State University

12. Kim, Taemin. Exploration of High-level Synthesis Techniques to Improve Computational Intensive VLSI Designs.

Degree: PhD, Computer Engineering, 2009, North Carolina State University

 Optimization techniques during high level synthesis procedure are often preferred since design decisions at early stages of a design flow are believed to have a… (more)

Subjects/Keywords: High Level Synthesis; Global Interconnect; VLSI CAD; Optimization; Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kim, T. (2009). Exploration of High-level Synthesis Techniques to Improve Computational Intensive VLSI Designs. (Doctoral Dissertation). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/4109

Chicago Manual of Style (16th Edition):

Kim, Taemin. “Exploration of High-level Synthesis Techniques to Improve Computational Intensive VLSI Designs.” 2009. Doctoral Dissertation, North Carolina State University. Accessed October 18, 2019. http://www.lib.ncsu.edu/resolver/1840.16/4109.

MLA Handbook (7th Edition):

Kim, Taemin. “Exploration of High-level Synthesis Techniques to Improve Computational Intensive VLSI Designs.” 2009. Web. 18 Oct 2019.

Vancouver:

Kim T. Exploration of High-level Synthesis Techniques to Improve Computational Intensive VLSI Designs. [Internet] [Doctoral dissertation]. North Carolina State University; 2009. [cited 2019 Oct 18]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/4109.

Council of Science Editors:

Kim T. Exploration of High-level Synthesis Techniques to Improve Computational Intensive VLSI Designs. [Doctoral Dissertation]. North Carolina State University; 2009. Available from: http://www.lib.ncsu.edu/resolver/1840.16/4109


Wright State University

13. Venugopal Chengappa, Bharath. A Study of Evolvable Hardware Adaptive Oscillators for Augmentation of Flapping-Wing Micro Air Vehicle Altitude Control.

Degree: MSCE, Computer Engineering, 2010, Wright State University

 The control of insect-sized flapping-wing micro air vehicles is fraughtwith difficulties. Even when adequate control laws are known, limits oncomputational precision and floating-point processing can… (more)

Subjects/Keywords: Computer Science; Mutation Rate; FW-MAV; Minipop; Wing; Minipop Algorithm; e¿¿¿¿¿¿¿ects; Population Size

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Venugopal Chengappa, B. (2010). A Study of Evolvable Hardware Adaptive Oscillators for Augmentation of Flapping-Wing Micro Air Vehicle Altitude Control. (Masters Thesis). Wright State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=wright1278968118

Chicago Manual of Style (16th Edition):

Venugopal Chengappa, Bharath. “A Study of Evolvable Hardware Adaptive Oscillators for Augmentation of Flapping-Wing Micro Air Vehicle Altitude Control.” 2010. Masters Thesis, Wright State University. Accessed October 18, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=wright1278968118.

MLA Handbook (7th Edition):

Venugopal Chengappa, Bharath. “A Study of Evolvable Hardware Adaptive Oscillators for Augmentation of Flapping-Wing Micro Air Vehicle Altitude Control.” 2010. Web. 18 Oct 2019.

Vancouver:

Venugopal Chengappa B. A Study of Evolvable Hardware Adaptive Oscillators for Augmentation of Flapping-Wing Micro Air Vehicle Altitude Control. [Internet] [Masters thesis]. Wright State University; 2010. [cited 2019 Oct 18]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=wright1278968118.

Council of Science Editors:

Venugopal Chengappa B. A Study of Evolvable Hardware Adaptive Oscillators for Augmentation of Flapping-Wing Micro Air Vehicle Altitude Control. [Masters Thesis]. Wright State University; 2010. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=wright1278968118

14. Ma, Jiya. A Genetic Algorithm for Solar Boat.

Degree: Computer Engineering, 2008, Dalarna University

  Genetic algorithm has been widely used in different areas of optimization problems. Ithas been combined with renewable energy domain, photovoltaic system, in this thesis.To… (more)

Subjects/Keywords: Photovoltaic System; Standalone System with Back up; Heuristic function; Genetic Algorithm optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ma, J. (2008). A Genetic Algorithm for Solar Boat. (Thesis). Dalarna University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:du-3488

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):

Ma, Jiya. “A Genetic Algorithm for Solar Boat.” 2008. Thesis, Dalarna University. Accessed October 18, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:du-3488.

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

MLA Handbook (7th Edition):

Ma, Jiya. “A Genetic Algorithm for Solar Boat.” 2008. Web. 18 Oct 2019.

Vancouver:

Ma J. A Genetic Algorithm for Solar Boat. [Internet] [Thesis]. Dalarna University; 2008. [cited 2019 Oct 18]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:du-3488.

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

Council of Science Editors:

Ma J. A Genetic Algorithm for Solar Boat. [Thesis]. Dalarna University; 2008. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:du-3488

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

15. Lierde, Boris Van. Developing Box-Pushing Behaviours Using Evolutionary Robotics.

Degree: Computer Engineering, 2011, Dalarna University

  The context of this report and the IRIDIA laboratory are described in the preface. Evolutionary Robotics and the box-pushing task are presented in the… (more)

Subjects/Keywords: Evolutionary robotics; bootstrapping problem; box pushing; continuous time recurrent neural network; CTRNN; genetic algorithm.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lierde, B. V. (2011). Developing Box-Pushing Behaviours Using Evolutionary Robotics. (Thesis). Dalarna University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:du-6250

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):

Lierde, Boris Van. “Developing Box-Pushing Behaviours Using Evolutionary Robotics.” 2011. Thesis, Dalarna University. Accessed October 18, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:du-6250.

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

MLA Handbook (7th Edition):

Lierde, Boris Van. “Developing Box-Pushing Behaviours Using Evolutionary Robotics.” 2011. Web. 18 Oct 2019.

Vancouver:

Lierde BV. Developing Box-Pushing Behaviours Using Evolutionary Robotics. [Internet] [Thesis]. Dalarna University; 2011. [cited 2019 Oct 18]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:du-6250.

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

Council of Science Editors:

Lierde BV. Developing Box-Pushing Behaviours Using Evolutionary Robotics. [Thesis]. Dalarna University; 2011. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:du-6250

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

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

Degree: Computer Engineering, 2009, Dalarna University

  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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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

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):

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

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

MLA Handbook (7th Edition):

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

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

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


University of Tennessee – Knoxville

17. Zhang, Yang. Scheduling for Timely Passenger Delivery in a Large Scale Ride Sharing System.

Degree: MS, Computer Engineering, 2016, University of Tennessee – Knoxville

  Taxi ride sharing is one of the most promising solutions to urban transportation issues, such as traffic congestion, gas insufficiency, air pollution, limited parking… (more)

Subjects/Keywords: ride sharing; greedy algorithm; vehicle routing problem; mixed integer programming; Other Computer Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, Y. (2016). Scheduling for Timely Passenger Delivery in a Large Scale Ride Sharing System. (Thesis). University of Tennessee – Knoxville. Retrieved from https://trace.tennessee.edu/utk_gradthes/4275

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):

Zhang, Yang. “Scheduling for Timely Passenger Delivery in a Large Scale Ride Sharing System.” 2016. Thesis, University of Tennessee – Knoxville. Accessed October 18, 2019. https://trace.tennessee.edu/utk_gradthes/4275.

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

MLA Handbook (7th Edition):

Zhang, Yang. “Scheduling for Timely Passenger Delivery in a Large Scale Ride Sharing System.” 2016. Web. 18 Oct 2019.

Vancouver:

Zhang Y. Scheduling for Timely Passenger Delivery in a Large Scale Ride Sharing System. [Internet] [Thesis]. University of Tennessee – Knoxville; 2016. [cited 2019 Oct 18]. Available from: https://trace.tennessee.edu/utk_gradthes/4275.

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

Council of Science Editors:

Zhang Y. Scheduling for Timely Passenger Delivery in a Large Scale Ride Sharing System. [Thesis]. University of Tennessee – Knoxville; 2016. Available from: https://trace.tennessee.edu/utk_gradthes/4275

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


Virginia Tech

18. Rahman, Md Moshiur. Design and Implementation of a Web-based Home Energy Management System for Demand Response Applications.

Degree: MS, Computer Engineering, 2013, Virginia Tech

 The objective of this work is to design and implement an architectural framework for a web-based demand management system that allows an electric utility to… (more)

Subjects/Keywords: Home Energy Management System; Demand Response/Load Control; Controllable Loads; Demand Response Algorithm; Demand Compensation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rahman, M. M. (2013). Design and Implementation of a Web-based Home Energy Management System for Demand Response Applications. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/23689

Chicago Manual of Style (16th Edition):

Rahman, Md Moshiur. “Design and Implementation of a Web-based Home Energy Management System for Demand Response Applications.” 2013. Masters Thesis, Virginia Tech. Accessed October 18, 2019. http://hdl.handle.net/10919/23689.

MLA Handbook (7th Edition):

Rahman, Md Moshiur. “Design and Implementation of a Web-based Home Energy Management System for Demand Response Applications.” 2013. Web. 18 Oct 2019.

Vancouver:

Rahman MM. Design and Implementation of a Web-based Home Energy Management System for Demand Response Applications. [Internet] [Masters thesis]. Virginia Tech; 2013. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/10919/23689.

Council of Science Editors:

Rahman MM. Design and Implementation of a Web-based Home Energy Management System for Demand Response Applications. [Masters Thesis]. Virginia Tech; 2013. Available from: http://hdl.handle.net/10919/23689


University of Southern California

19. Le, Hoang Xuan. High performance architectures for large-scale packet forwarding and string pattern matching.

Degree: PhD, Computer Engineering, 2011, University of Southern California

 The internet has grown explosively to a giant open network. Routers in the backbone should simply move traffic as fast as possible. However, packet forwarding… (more)

Subjects/Keywords: network routers; IP lookup; packet forwarding; FPGA; NDIS; trie-based IP lookup; tree-based IP lookup; string matching

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Le, H. X. (2011). High performance architectures for large-scale packet forwarding and string pattern matching. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/669914/rec/3168

Chicago Manual of Style (16th Edition):

Le, Hoang Xuan. “High performance architectures for large-scale packet forwarding and string pattern matching.” 2011. Doctoral Dissertation, University of Southern California. Accessed October 18, 2019. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/669914/rec/3168.

MLA Handbook (7th Edition):

Le, Hoang Xuan. “High performance architectures for large-scale packet forwarding and string pattern matching.” 2011. Web. 18 Oct 2019.

Vancouver:

Le HX. High performance architectures for large-scale packet forwarding and string pattern matching. [Internet] [Doctoral dissertation]. University of Southern California; 2011. [cited 2019 Oct 18]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/669914/rec/3168.

Council of Science Editors:

Le HX. High performance architectures for large-scale packet forwarding and string pattern matching. [Doctoral Dissertation]. University of Southern California; 2011. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/669914/rec/3168

20. Kumar, Magesh Kumar Udaya. Classification of Parkinson’s Disease using MultiPass Lvq,Logistic Model Tree,K-Star for Audio Data set : Classification of Parkinson Disease using Audio Dataset.

Degree: Computer Engineering, 2011, Dalarna University

  Parkinson's disease (PD) is a degenerative illness whose cardinal symptoms include rigidity, tremor, and slowness of movement. In addition to its widely recognized effects… (more)

Subjects/Keywords: Parkinson; Audio Data set; MultiPass Lvq; Logistic Model Tree; K-Star; Hypokinetic Dysarthria; Weka; Artificial Intelligence; Speech; Speech Features; Acoustics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kumar, M. K. U. (2011). Classification of Parkinson’s Disease using MultiPass Lvq,Logistic Model Tree,K-Star for Audio Data set : Classification of Parkinson Disease using Audio Dataset. (Thesis). Dalarna University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:du-5596

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):

Kumar, Magesh Kumar Udaya. “Classification of Parkinson’s Disease using MultiPass Lvq,Logistic Model Tree,K-Star for Audio Data set : Classification of Parkinson Disease using Audio Dataset.” 2011. Thesis, Dalarna University. Accessed October 18, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:du-5596.

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

MLA Handbook (7th Edition):

Kumar, Magesh Kumar Udaya. “Classification of Parkinson’s Disease using MultiPass Lvq,Logistic Model Tree,K-Star for Audio Data set : Classification of Parkinson Disease using Audio Dataset.” 2011. Web. 18 Oct 2019.

Vancouver:

Kumar MKU. Classification of Parkinson’s Disease using MultiPass Lvq,Logistic Model Tree,K-Star for Audio Data set : Classification of Parkinson Disease using Audio Dataset. [Internet] [Thesis]. Dalarna University; 2011. [cited 2019 Oct 18]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:du-5596.

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

Council of Science Editors:

Kumar MKU. Classification of Parkinson’s Disease using MultiPass Lvq,Logistic Model Tree,K-Star for Audio Data set : Classification of Parkinson Disease using Audio Dataset. [Thesis]. Dalarna University; 2011. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:du-5596

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


North Carolina State University

21. Rogers, Brian Michael. Low-Overhead Designs for Secure Uniprocessor and Multiprocessor Architectures.

Degree: PhD, Computer Engineering, 2009, North Carolina State University

 The security of computer systems is becoming a growing concern as the increasing ability and motivation of attackers continues to expand the types of attacks… (more)

Subjects/Keywords: memory authentication; memory encryption; address independent seed encryption; bonsai merkle tree; secure processor architecture; secure DSM multiprocessor

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rogers, B. M. (2009). Low-Overhead Designs for Secure Uniprocessor and Multiprocessor Architectures. (Doctoral Dissertation). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/3283

Chicago Manual of Style (16th Edition):

Rogers, Brian Michael. “Low-Overhead Designs for Secure Uniprocessor and Multiprocessor Architectures.” 2009. Doctoral Dissertation, North Carolina State University. Accessed October 18, 2019. http://www.lib.ncsu.edu/resolver/1840.16/3283.

MLA Handbook (7th Edition):

Rogers, Brian Michael. “Low-Overhead Designs for Secure Uniprocessor and Multiprocessor Architectures.” 2009. Web. 18 Oct 2019.

Vancouver:

Rogers BM. Low-Overhead Designs for Secure Uniprocessor and Multiprocessor Architectures. [Internet] [Doctoral dissertation]. North Carolina State University; 2009. [cited 2019 Oct 18]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/3283.

Council of Science Editors:

Rogers BM. Low-Overhead Designs for Secure Uniprocessor and Multiprocessor Architectures. [Doctoral Dissertation]. North Carolina State University; 2009. Available from: http://www.lib.ncsu.edu/resolver/1840.16/3283


Missouri University of Science and Technology

22. Erkol, Bulent. Automatic tumor border detection in dermoscopy images using gradient vector flow snakes.

Degree: M.S. in Computer Engineering, Computer Engineering, Missouri University of Science and Technology

 "This thesis applies Gradient Vector Flow Snakes to find the tumor border in melanoma and non-melanoma dermoscopy images. Snakes, or active contours, have been widely… (more)

Subjects/Keywords: Gradient vector flow snakes; Snake algorithm; Computer Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Erkol, B. (n.d.). Automatic tumor border detection in dermoscopy images using gradient vector flow snakes. (Masters Thesis). Missouri University of Science and Technology. Retrieved from http://scholarsmine.mst.edu/masters_theses/2380

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Chicago Manual of Style (16th Edition):

Erkol, Bulent. “Automatic tumor border detection in dermoscopy images using gradient vector flow snakes.” Masters Thesis, Missouri University of Science and Technology. Accessed October 18, 2019. http://scholarsmine.mst.edu/masters_theses/2380.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

MLA Handbook (7th Edition):

Erkol, Bulent. “Automatic tumor border detection in dermoscopy images using gradient vector flow snakes.” Web. 18 Oct 2019.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Vancouver:

Erkol B. Automatic tumor border detection in dermoscopy images using gradient vector flow snakes. [Internet] [Masters thesis]. Missouri University of Science and Technology; [cited 2019 Oct 18]. Available from: http://scholarsmine.mst.edu/masters_theses/2380.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Council of Science Editors:

Erkol B. Automatic tumor border detection in dermoscopy images using gradient vector flow snakes. [Masters Thesis]. Missouri University of Science and Technology; Available from: http://scholarsmine.mst.edu/masters_theses/2380

Note: this citation may be lacking information needed for this citation format:
No year of publication.


University of Southern California

23. Zhuo, Ling. High-performance linear algebra on reconfigurable computing systems.

Degree: PhD, Computer Engineering, 2007, University of Southern California

 Recently, high-end computing systems have been introduced that employ reconfigurable hardware as application-specific hardware accelerators for general-purpose processors. These systems provide new opportunities for high-performance… (more)

Subjects/Keywords: reconfigurable computing; high-performance computing; algorithm design; matrix operations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhuo, L. (2007). High-performance linear algebra on reconfigurable computing systems. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/543521/rec/3180

Chicago Manual of Style (16th Edition):

Zhuo, Ling. “High-performance linear algebra on reconfigurable computing systems.” 2007. Doctoral Dissertation, University of Southern California. Accessed October 18, 2019. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/543521/rec/3180.

MLA Handbook (7th Edition):

Zhuo, Ling. “High-performance linear algebra on reconfigurable computing systems.” 2007. Web. 18 Oct 2019.

Vancouver:

Zhuo L. High-performance linear algebra on reconfigurable computing systems. [Internet] [Doctoral dissertation]. University of Southern California; 2007. [cited 2019 Oct 18]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/543521/rec/3180.

Council of Science Editors:

Zhuo L. High-performance linear algebra on reconfigurable computing systems. [Doctoral Dissertation]. University of Southern California; 2007. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/543521/rec/3180

24. Feng, Sitao. Evaluation of Red Colour Segmentation Algorithms in Traffic Signs Detection.

Degree: Computer Engineering, 2010, Dalarna University

  Colour segmentation is the most commonly used method in road signs detection. Road sign contains several basic colours such as red, yellow, blue and… (more)

Subjects/Keywords: Traffic signs; Colour Segmentation; Dynamic Threshold Algorithm; A Modification of de la Escalera’s Algorithm; the Fuzzy Colour Segmentation Algorithm; Shadow and Highlight Invariant Algorithm.

…algorithms in the detection phase. The algorithms include Dynamic Threshold Algorithm, A… …Modification of de la Escalera’s Algorithm, the Fuzzy Colour Segmentation Algorithm and Shadow and… …Highlight Invariant Algorithm. These algorithms are most used in the detection phase. The images… …rate of every algorithm under every condition. • the maximum, minimum and average processing… …times and the standard deviation of each algorithm Three experiments are carried out to… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Feng, S. (2010). Evaluation of Red Colour Segmentation Algorithms in Traffic Signs Detection. (Thesis). Dalarna University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:du-5806

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):

Feng, Sitao. “Evaluation of Red Colour Segmentation Algorithms in Traffic Signs Detection.” 2010. Thesis, Dalarna University. Accessed October 18, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:du-5806.

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

MLA Handbook (7th Edition):

Feng, Sitao. “Evaluation of Red Colour Segmentation Algorithms in Traffic Signs Detection.” 2010. Web. 18 Oct 2019.

Vancouver:

Feng S. Evaluation of Red Colour Segmentation Algorithms in Traffic Signs Detection. [Internet] [Thesis]. Dalarna University; 2010. [cited 2019 Oct 18]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:du-5806.

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

Council of Science Editors:

Feng S. Evaluation of Red Colour Segmentation Algorithms in Traffic Signs Detection. [Thesis]. Dalarna University; 2010. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:du-5806

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


University of Tennessee – Knoxville

25. Vanguri, Phani Bharadwaj. An FPGA Based Implementation of the Exact Stochastic Simulation Algorithm.

Degree: MS, Computer Engineering, 2010, University of Tennessee – Knoxville

 Mathematical and statistical modeling of biological systems is a desired goal for many years. Many biochemical models are often evaluated using a deterministic approach, which… (more)

Subjects/Keywords: stochastic; FPGA; vlsi; simulation; algorithm; hpc; Digital Circuits; Hardware Systems; VLSI and Circuits, Embedded and Hardware Systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vanguri, P. B. (2010). An FPGA Based Implementation of the Exact Stochastic Simulation Algorithm. (Thesis). University of Tennessee – Knoxville. Retrieved from https://trace.tennessee.edu/utk_gradthes/837

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):

Vanguri, Phani Bharadwaj. “An FPGA Based Implementation of the Exact Stochastic Simulation Algorithm.” 2010. Thesis, University of Tennessee – Knoxville. Accessed October 18, 2019. https://trace.tennessee.edu/utk_gradthes/837.

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

MLA Handbook (7th Edition):

Vanguri, Phani Bharadwaj. “An FPGA Based Implementation of the Exact Stochastic Simulation Algorithm.” 2010. Web. 18 Oct 2019.

Vancouver:

Vanguri PB. An FPGA Based Implementation of the Exact Stochastic Simulation Algorithm. [Internet] [Thesis]. University of Tennessee – Knoxville; 2010. [cited 2019 Oct 18]. Available from: https://trace.tennessee.edu/utk_gradthes/837.

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

Council of Science Editors:

Vanguri PB. An FPGA Based Implementation of the Exact Stochastic Simulation Algorithm. [Thesis]. University of Tennessee – Knoxville; 2010. Available from: https://trace.tennessee.edu/utk_gradthes/837

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


Linköping University

26. Mellqvist, Tobias. One Million-Point FFT.

Degree: Computer Engineering, 2018, Linköping University

  The goal of this thesis has been to implement a hardware architecture for FPGA that calculates the fast Fourier transform (FFT) of a signal… (more)

Subjects/Keywords: Large FFT; FFT; Cooley–Tukey; SDF; Binary tree; FPGA; triangular matrix; Electrical Engineering, Electronic Engineering, Information Engineering; Elektroteknik och elektronik; Signal Processing; Signalbehandling; Computer Systems; Datorsystem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mellqvist, T. (2018). One Million-Point FFT. (Thesis). Linköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-145306

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):

Mellqvist, Tobias. “One Million-Point FFT.” 2018. Thesis, Linköping University. Accessed October 18, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-145306.

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

MLA Handbook (7th Edition):

Mellqvist, Tobias. “One Million-Point FFT.” 2018. Web. 18 Oct 2019.

Vancouver:

Mellqvist T. One Million-Point FFT. [Internet] [Thesis]. Linköping University; 2018. [cited 2019 Oct 18]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-145306.

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

Council of Science Editors:

Mellqvist T. One Million-Point FFT. [Thesis]. Linköping University; 2018. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-145306

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


North Carolina State University

27. Mineo, Christopher Alexander. Clock Tree Insertion and Verification for 3D Integrated Circuits.

Degree: MS, Computer Engineering, 2005, North Carolina State University

 The use of three dimensional chip fabrication technologies has emerged as a solution to the difficulties involved with the continued scaling of bulk silicon devices.… (more)

Subjects/Keywords: clock tree synthesis; timing verification; circuit simulation; static timing; 3DIC

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mineo, C. A. (2005). Clock Tree Insertion and Verification for 3D Integrated Circuits. (Thesis). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/1294

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):

Mineo, Christopher Alexander. “Clock Tree Insertion and Verification for 3D Integrated Circuits.” 2005. Thesis, North Carolina State University. Accessed October 18, 2019. http://www.lib.ncsu.edu/resolver/1840.16/1294.

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

MLA Handbook (7th Edition):

Mineo, Christopher Alexander. “Clock Tree Insertion and Verification for 3D Integrated Circuits.” 2005. Web. 18 Oct 2019.

Vancouver:

Mineo CA. Clock Tree Insertion and Verification for 3D Integrated Circuits. [Internet] [Thesis]. North Carolina State University; 2005. [cited 2019 Oct 18]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/1294.

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

Council of Science Editors:

Mineo CA. Clock Tree Insertion and Verification for 3D Integrated Circuits. [Thesis]. North Carolina State University; 2005. Available from: http://www.lib.ncsu.edu/resolver/1840.16/1294

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

28. Bremang, Appah. Using ant colonies for solve the multiprocessor task graph scheduling.

Degree: Computer Engineering, 2006, Dalarna University

  The problem of scheduling a parallel program presented by a weighted directed acyclic graph (DAG) to the set of homogeneous processors for minimizing the… (more)

Subjects/Keywords: Multiprocessor scheduling problems; ant colony algorithm; ant system; pheromone trail; makespan.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bremang, A. (2006). Using ant colonies for solve the multiprocessor task graph scheduling. (Thesis). Dalarna University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:du-2381

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):

Bremang, Appah. “Using ant colonies for solve the multiprocessor task graph scheduling.” 2006. Thesis, Dalarna University. Accessed October 18, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:du-2381.

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

MLA Handbook (7th Edition):

Bremang, Appah. “Using ant colonies for solve the multiprocessor task graph scheduling.” 2006. Web. 18 Oct 2019.

Vancouver:

Bremang A. Using ant colonies for solve the multiprocessor task graph scheduling. [Internet] [Thesis]. Dalarna University; 2006. [cited 2019 Oct 18]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:du-2381.

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

Council of Science Editors:

Bremang A. Using ant colonies for solve the multiprocessor task graph scheduling. [Thesis]. Dalarna University; 2006. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:du-2381

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

29. Kovàcs, Akos. Solving the Vehicle Routing Problem with Genetic ALgorithm and Simulated Annealing.

Degree: Computer Engineering, 2008, Dalarna University

  This Thesis Work will concentrate on a very interesting problem, the Vehicle Routing Problem (VRP). In this problem, customers or cities have to be… (more)

Subjects/Keywords: Simulated Annealing; SA; Genetic Algorithm; GA; Traveling Salesman Problem; TSP; Vehicle Routing Problem; VRP; heuristics; solution; optimal solution; path; feasible path; search taboo search; heuristics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kovàcs, A. (2008). Solving the Vehicle Routing Problem with Genetic ALgorithm and Simulated Annealing. (Thesis). Dalarna University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:du-3306

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):

Kovàcs, Akos. “Solving the Vehicle Routing Problem with Genetic ALgorithm and Simulated Annealing.” 2008. Thesis, Dalarna University. Accessed October 18, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:du-3306.

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

MLA Handbook (7th Edition):

Kovàcs, Akos. “Solving the Vehicle Routing Problem with Genetic ALgorithm and Simulated Annealing.” 2008. Web. 18 Oct 2019.

Vancouver:

Kovàcs A. Solving the Vehicle Routing Problem with Genetic ALgorithm and Simulated Annealing. [Internet] [Thesis]. Dalarna University; 2008. [cited 2019 Oct 18]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:du-3306.

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

Council of Science Editors:

Kovàcs A. Solving the Vehicle Routing Problem with Genetic ALgorithm and Simulated Annealing. [Thesis]. Dalarna University; 2008. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:du-3306

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

30. Kandil, Sarah Mahmoud Atef Hosny. Planning of PEVs Parking Lots in Conjunction With Renewable Energy Resources and Battery Energy Storage Systems.

Degree: MASc - Master of Applied Science, Computer Engineering, 2016, York University

 The last few decades have seen growing concerns about climate change caused by global warming, which is cause primarily by CO2 emissions. Thus, the reduction… (more)

Subjects/Keywords: Electrical engineering; Plugged in electric vehicles; Renewable energy resources; Global worming; Emissions; Optimization; Modelling; Battery energy storage systems; Solar; Planning; Parking lots; Wind; GAMS; Genetic algorithm; Matlab

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kandil, S. M. A. H. (2016). Planning of PEVs Parking Lots in Conjunction With Renewable Energy Resources and Battery Energy Storage Systems. (Masters Thesis). York University. Retrieved from http://hdl.handle.net/10315/32180

Chicago Manual of Style (16th Edition):

Kandil, Sarah Mahmoud Atef Hosny. “Planning of PEVs Parking Lots in Conjunction With Renewable Energy Resources and Battery Energy Storage Systems.” 2016. Masters Thesis, York University. Accessed October 18, 2019. http://hdl.handle.net/10315/32180.

MLA Handbook (7th Edition):

Kandil, Sarah Mahmoud Atef Hosny. “Planning of PEVs Parking Lots in Conjunction With Renewable Energy Resources and Battery Energy Storage Systems.” 2016. Web. 18 Oct 2019.

Vancouver:

Kandil SMAH. Planning of PEVs Parking Lots in Conjunction With Renewable Energy Resources and Battery Energy Storage Systems. [Internet] [Masters thesis]. York University; 2016. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/10315/32180.

Council of Science Editors:

Kandil SMAH. Planning of PEVs Parking Lots in Conjunction With Renewable Energy Resources and Battery Energy Storage Systems. [Masters Thesis]. York University; 2016. Available from: http://hdl.handle.net/10315/32180

[1] [2]

.