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:(Computer algorithms ). Showing records 1 – 30 of 2049 total matches.

[1] [2] [3] [4] [5] … [69]

Search Limiters

Last 2 Years | English Only

Levels

Languages

Country

▼ Search Limiters


Nelson Mandela Metropolitan University

1. Kapp, Konrad Phillip. Optimal cycle dating of large financial time series.

Degree: Faculty of Science, 2017, Nelson Mandela Metropolitan University

 The study of cycles in the context of economic time series has been active for many decades, if not centuries; however, it was only in… (more)

Subjects/Keywords: Computer algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kapp, K. P. (2017). Optimal cycle dating of large financial time series. (Thesis). Nelson Mandela Metropolitan University. Retrieved from http://hdl.handle.net/10948/17767

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

Kapp, Konrad Phillip. “Optimal cycle dating of large financial time series.” 2017. Thesis, Nelson Mandela Metropolitan University. Accessed February 26, 2020. http://hdl.handle.net/10948/17767.

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

MLA Handbook (7th Edition):

Kapp, Konrad Phillip. “Optimal cycle dating of large financial time series.” 2017. Web. 26 Feb 2020.

Vancouver:

Kapp KP. Optimal cycle dating of large financial time series. [Internet] [Thesis]. Nelson Mandela Metropolitan University; 2017. [cited 2020 Feb 26]. Available from: http://hdl.handle.net/10948/17767.

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

Council of Science Editors:

Kapp KP. Optimal cycle dating of large financial time series. [Thesis]. Nelson Mandela Metropolitan University; 2017. Available from: http://hdl.handle.net/10948/17767

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


Brock University

2. Brown, Joseph Alexander. Decoding algorithms using side-effect machines .

Degree: Department of Computer Science, 2010, Brock University

 Bioinformatics applies computers to problems in molecular biology. Previous research has not addressed edit metric decoders. Decoders for quaternary edit metric codes are finding use… (more)

Subjects/Keywords: Computer algorithms.; Bioinformatics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Brown, J. A. (2010). Decoding algorithms using side-effect machines . (Thesis). Brock University. Retrieved from http://hdl.handle.net/10464/2941

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

Brown, Joseph Alexander. “Decoding algorithms using side-effect machines .” 2010. Thesis, Brock University. Accessed February 26, 2020. http://hdl.handle.net/10464/2941.

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

MLA Handbook (7th Edition):

Brown, Joseph Alexander. “Decoding algorithms using side-effect machines .” 2010. Web. 26 Feb 2020.

Vancouver:

Brown JA. Decoding algorithms using side-effect machines . [Internet] [Thesis]. Brock University; 2010. [cited 2020 Feb 26]. Available from: http://hdl.handle.net/10464/2941.

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

Council of Science Editors:

Brown JA. Decoding algorithms using side-effect machines . [Thesis]. Brock University; 2010. Available from: http://hdl.handle.net/10464/2941

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


University of Oklahoma

3. Li, Yu-Hsin. FINDING MINIMUM GAPS AND DESIGNING KEY DERIVATION FUNCTIONS.

Degree: PhD, 2011, University of Oklahoma

 Key generation is an important part of symmetric-key encryption algorithms, such as AES. A key derivation function can be used to generate symmetric cipher session… (more)

Subjects/Keywords: Cryptography; Computer algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, Y. (2011). FINDING MINIMUM GAPS AND DESIGNING KEY DERIVATION FUNCTIONS. (Doctoral Dissertation). University of Oklahoma. Retrieved from http://hdl.handle.net/11244/319191

Chicago Manual of Style (16th Edition):

Li, Yu-Hsin. “FINDING MINIMUM GAPS AND DESIGNING KEY DERIVATION FUNCTIONS.” 2011. Doctoral Dissertation, University of Oklahoma. Accessed February 26, 2020. http://hdl.handle.net/11244/319191.

MLA Handbook (7th Edition):

Li, Yu-Hsin. “FINDING MINIMUM GAPS AND DESIGNING KEY DERIVATION FUNCTIONS.” 2011. Web. 26 Feb 2020.

Vancouver:

Li Y. FINDING MINIMUM GAPS AND DESIGNING KEY DERIVATION FUNCTIONS. [Internet] [Doctoral dissertation]. University of Oklahoma; 2011. [cited 2020 Feb 26]. Available from: http://hdl.handle.net/11244/319191.

Council of Science Editors:

Li Y. FINDING MINIMUM GAPS AND DESIGNING KEY DERIVATION FUNCTIONS. [Doctoral Dissertation]. University of Oklahoma; 2011. Available from: http://hdl.handle.net/11244/319191


University of Hong Kong

4. He, Shuiqing. Spectral analysis of medial axis for shape description.

Degree: PhD, 2015, University of Hong Kong

In this thesis, we make several significant achievements towards defining a medial axis based shape descriptor which is compact, yet discriminative. First, we propose a… (more)

Subjects/Keywords: Computer algorithms; Computer graphics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

He, S. (2015). Spectral analysis of medial axis for shape description. (Doctoral Dissertation). University of Hong Kong. Retrieved from He, S. [何水清]. (2015). Spectral analysis of medial axis for shape description. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5543990 ; http://hdl.handle.net/10722/212606

Chicago Manual of Style (16th Edition):

He, Shuiqing. “Spectral analysis of medial axis for shape description.” 2015. Doctoral Dissertation, University of Hong Kong. Accessed February 26, 2020. He, S. [何水清]. (2015). Spectral analysis of medial axis for shape description. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5543990 ; http://hdl.handle.net/10722/212606.

MLA Handbook (7th Edition):

He, Shuiqing. “Spectral analysis of medial axis for shape description.” 2015. Web. 26 Feb 2020.

Vancouver:

He S. Spectral analysis of medial axis for shape description. [Internet] [Doctoral dissertation]. University of Hong Kong; 2015. [cited 2020 Feb 26]. Available from: He, S. [何水清]. (2015). Spectral analysis of medial axis for shape description. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5543990 ; http://hdl.handle.net/10722/212606.

Council of Science Editors:

He S. Spectral analysis of medial axis for shape description. [Doctoral Dissertation]. University of Hong Kong; 2015. Available from: He, S. [何水清]. (2015). Spectral analysis of medial axis for shape description. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5543990 ; http://hdl.handle.net/10722/212606


University of Hong Kong

5. 李榕滨; Li, Rongbin. New competitive algorithms for online job scheduling.

Degree: PhD, 2014, University of Hong Kong

 Job scheduling, which greatly impacts on the system performance, is a fundamental problem in computer science. In this thesis, we study three kinds of scheduling… (more)

Subjects/Keywords: Computer scheduling; Computer algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

李榕滨; Li, R. (2014). New competitive algorithms for online job scheduling. (Doctoral Dissertation). University of Hong Kong. Retrieved from Li, R. [李榕滨]. (2014). New competitive algorithms for online job scheduling. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5194790 ; http://dx.doi.org/10.5353/th_b5194790 ; http://hdl.handle.net/10722/197555

Chicago Manual of Style (16th Edition):

李榕滨; Li, Rongbin. “New competitive algorithms for online job scheduling.” 2014. Doctoral Dissertation, University of Hong Kong. Accessed February 26, 2020. Li, R. [李榕滨]. (2014). New competitive algorithms for online job scheduling. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5194790 ; http://dx.doi.org/10.5353/th_b5194790 ; http://hdl.handle.net/10722/197555.

MLA Handbook (7th Edition):

李榕滨; Li, Rongbin. “New competitive algorithms for online job scheduling.” 2014. Web. 26 Feb 2020.

Vancouver:

李榕滨; Li R. New competitive algorithms for online job scheduling. [Internet] [Doctoral dissertation]. University of Hong Kong; 2014. [cited 2020 Feb 26]. Available from: Li, R. [李榕滨]. (2014). New competitive algorithms for online job scheduling. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5194790 ; http://dx.doi.org/10.5353/th_b5194790 ; http://hdl.handle.net/10722/197555.

Council of Science Editors:

李榕滨; Li R. New competitive algorithms for online job scheduling. [Doctoral Dissertation]. University of Hong Kong; 2014. Available from: Li, R. [李榕滨]. (2014). New competitive algorithms for online job scheduling. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5194790 ; http://dx.doi.org/10.5353/th_b5194790 ; http://hdl.handle.net/10722/197555


University of Hong Kong

6. Zhu, Yanshu. Compact representation of medial axis transform.

Degree: PhD, 2014, University of Hong Kong

Shape representation is a fundamental topic in geometric modeling, which is ubiquitous in computer graphics. Compared with the explicit and implicit shape representations, the medial… (more)

Subjects/Keywords: Computer graphics; Computer algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhu, Y. (2014). Compact representation of medial axis transform. (Doctoral Dissertation). University of Hong Kong. Retrieved from Zhu, Y. [朱妍姝]. (2014). Compact representation of medial axis transform. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5317048 ; http://dx.doi.org/10.5353/th_b5317048 ; http://hdl.handle.net/10722/206472

Chicago Manual of Style (16th Edition):

Zhu, Yanshu. “Compact representation of medial axis transform.” 2014. Doctoral Dissertation, University of Hong Kong. Accessed February 26, 2020. Zhu, Y. [朱妍姝]. (2014). Compact representation of medial axis transform. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5317048 ; http://dx.doi.org/10.5353/th_b5317048 ; http://hdl.handle.net/10722/206472.

MLA Handbook (7th Edition):

Zhu, Yanshu. “Compact representation of medial axis transform.” 2014. Web. 26 Feb 2020.

Vancouver:

Zhu Y. Compact representation of medial axis transform. [Internet] [Doctoral dissertation]. University of Hong Kong; 2014. [cited 2020 Feb 26]. Available from: Zhu, Y. [朱妍姝]. (2014). Compact representation of medial axis transform. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5317048 ; http://dx.doi.org/10.5353/th_b5317048 ; http://hdl.handle.net/10722/206472.

Council of Science Editors:

Zhu Y. Compact representation of medial axis transform. [Doctoral Dissertation]. University of Hong Kong; 2014. Available from: Zhu, Y. [朱妍姝]. (2014). Compact representation of medial axis transform. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5317048 ; http://dx.doi.org/10.5353/th_b5317048 ; http://hdl.handle.net/10722/206472


University of Hong Kong

7. Zhu, Jianqiao. New results on online job scheduling.

Degree: M. Phil., 2013, University of Hong Kong

 This thesis presents several new results on online job scheduling. Job scheduling is a basic requirement of many practical computer systems, and the scheduling behavior… (more)

Subjects/Keywords: Computer scheduling.; Computer algorithms.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhu, J. (2013). New results on online job scheduling. (Masters Thesis). University of Hong Kong. Retrieved from Zhu, J. [朱剑桥]. (2013). New results on online job scheduling. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5066235 ; http://dx.doi.org/10.5353/th_b5066235 ; http://hdl.handle.net/10722/191210

Chicago Manual of Style (16th Edition):

Zhu, Jianqiao. “New results on online job scheduling.” 2013. Masters Thesis, University of Hong Kong. Accessed February 26, 2020. Zhu, J. [朱剑桥]. (2013). New results on online job scheduling. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5066235 ; http://dx.doi.org/10.5353/th_b5066235 ; http://hdl.handle.net/10722/191210.

MLA Handbook (7th Edition):

Zhu, Jianqiao. “New results on online job scheduling.” 2013. Web. 26 Feb 2020.

Vancouver:

Zhu J. New results on online job scheduling. [Internet] [Masters thesis]. University of Hong Kong; 2013. [cited 2020 Feb 26]. Available from: Zhu, J. [朱剑桥]. (2013). New results on online job scheduling. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5066235 ; http://dx.doi.org/10.5353/th_b5066235 ; http://hdl.handle.net/10722/191210.

Council of Science Editors:

Zhu J. New results on online job scheduling. [Masters Thesis]. University of Hong Kong; 2013. Available from: Zhu, J. [朱剑桥]. (2013). New results on online job scheduling. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5066235 ; http://dx.doi.org/10.5353/th_b5066235 ; http://hdl.handle.net/10722/191210


University of Hong Kong

8. 王睿; Wang, Rui. Medial axis simplification based on global geodesic slope and accumulated hyperbolic distance.

Degree: M. Phil., 2012, University of Hong Kong

The medial axis is an important shape representation and the computation of the medial axis is a fundamental research problem in computer graphics. Practically, the… (more)

Subjects/Keywords: Computer algorithms.; Computer graphics.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

王睿; Wang, R. (2012). Medial axis simplification based on global geodesic slope and accumulated hyperbolic distance. (Masters Thesis). University of Hong Kong. Retrieved from Wang, R. [王睿]. (2012). Medial axis simplification based on global geodesic slope and accumulated hyperbolic distance. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4833013 ; http://dx.doi.org/10.5353/th_b4833013 ; http://hdl.handle.net/10722/173883

Chicago Manual of Style (16th Edition):

王睿; Wang, Rui. “Medial axis simplification based on global geodesic slope and accumulated hyperbolic distance.” 2012. Masters Thesis, University of Hong Kong. Accessed February 26, 2020. Wang, R. [王睿]. (2012). Medial axis simplification based on global geodesic slope and accumulated hyperbolic distance. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4833013 ; http://dx.doi.org/10.5353/th_b4833013 ; http://hdl.handle.net/10722/173883.

MLA Handbook (7th Edition):

王睿; Wang, Rui. “Medial axis simplification based on global geodesic slope and accumulated hyperbolic distance.” 2012. Web. 26 Feb 2020.

Vancouver:

王睿; Wang R. Medial axis simplification based on global geodesic slope and accumulated hyperbolic distance. [Internet] [Masters thesis]. University of Hong Kong; 2012. [cited 2020 Feb 26]. Available from: Wang, R. [王睿]. (2012). Medial axis simplification based on global geodesic slope and accumulated hyperbolic distance. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4833013 ; http://dx.doi.org/10.5353/th_b4833013 ; http://hdl.handle.net/10722/173883.

Council of Science Editors:

王睿; Wang R. Medial axis simplification based on global geodesic slope and accumulated hyperbolic distance. [Masters Thesis]. University of Hong Kong; 2012. Available from: Wang, R. [王睿]. (2012). Medial axis simplification based on global geodesic slope and accumulated hyperbolic distance. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4833013 ; http://dx.doi.org/10.5353/th_b4833013 ; http://hdl.handle.net/10722/173883


Brock University

9. He, Liang. Properties and algorithms of the (n, k)-star graphs .

Degree: Department of Computer Science, 2009, Brock University

 The (n, k)-star interconnection network was proposed in 1995 as an attractive alternative to the n-star topology in parallel computation. The (n, k )-star has… (more)

Subjects/Keywords: Computer networks.; Multiprocessors.; Computer algorithms.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

He, L. (2009). Properties and algorithms of the (n, k)-star graphs . (Thesis). Brock University. Retrieved from http://hdl.handle.net/10464/2870

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

He, Liang. “Properties and algorithms of the (n, k)-star graphs .” 2009. Thesis, Brock University. Accessed February 26, 2020. http://hdl.handle.net/10464/2870.

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

MLA Handbook (7th Edition):

He, Liang. “Properties and algorithms of the (n, k)-star graphs .” 2009. Web. 26 Feb 2020.

Vancouver:

He L. Properties and algorithms of the (n, k)-star graphs . [Internet] [Thesis]. Brock University; 2009. [cited 2020 Feb 26]. Available from: http://hdl.handle.net/10464/2870.

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

Council of Science Editors:

He L. Properties and algorithms of the (n, k)-star graphs . [Thesis]. Brock University; 2009. Available from: http://hdl.handle.net/10464/2870

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


Brock University

10. Zhang, Fan. Properties and algorithms of the hyper-star graph and its related graphs .

Degree: Department of Computer Science, 2010, Brock University

 The hyper-star interconnection network was proposed in 2002 to overcome the drawbacks of the hypercube and its variations concerning the network cost, which is defined… (more)

Subjects/Keywords: Computer networks.; Multiprocessors.; Computer algorithms.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, F. (2010). Properties and algorithms of the hyper-star graph and its related graphs . (Thesis). Brock University. Retrieved from http://hdl.handle.net/10464/2951

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, Fan. “Properties and algorithms of the hyper-star graph and its related graphs .” 2010. Thesis, Brock University. Accessed February 26, 2020. http://hdl.handle.net/10464/2951.

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

MLA Handbook (7th Edition):

Zhang, Fan. “Properties and algorithms of the hyper-star graph and its related graphs .” 2010. Web. 26 Feb 2020.

Vancouver:

Zhang F. Properties and algorithms of the hyper-star graph and its related graphs . [Internet] [Thesis]. Brock University; 2010. [cited 2020 Feb 26]. Available from: http://hdl.handle.net/10464/2951.

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

Council of Science Editors:

Zhang F. Properties and algorithms of the hyper-star graph and its related graphs . [Thesis]. Brock University; 2010. Available from: http://hdl.handle.net/10464/2951

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


University of KwaZulu-Natal

11. [No author]. Improved roach-based algorithms for global optimization problems.

Degree: Computer science, 2014, University of KwaZulu-Natal

 Optimization of systems plays an important role in various fields including mathematics, economics, engineering and life sciences. A lot of real world optimization problems exist… (more)

Subjects/Keywords: Algorithms.; Computer algorithms.; Computer science.; Roach-based algorithms.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

author], [. (2014). Improved roach-based algorithms for global optimization problems. (Thesis). University of KwaZulu-Natal. Retrieved from http://hdl.handle.net/10413/12896

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

author], [No. “Improved roach-based algorithms for global optimization problems. ” 2014. Thesis, University of KwaZulu-Natal. Accessed February 26, 2020. http://hdl.handle.net/10413/12896.

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

MLA Handbook (7th Edition):

author], [No. “Improved roach-based algorithms for global optimization problems. ” 2014. Web. 26 Feb 2020.

Vancouver:

author] [. Improved roach-based algorithms for global optimization problems. [Internet] [Thesis]. University of KwaZulu-Natal; 2014. [cited 2020 Feb 26]. Available from: http://hdl.handle.net/10413/12896.

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

Council of Science Editors:

author] [. Improved roach-based algorithms for global optimization problems. [Thesis]. University of KwaZulu-Natal; 2014. Available from: http://hdl.handle.net/10413/12896

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


University of Western Australia

12. Czarn, Andrew Simon Timothy. Statistical exploratory analysis of genetic algorithms.

Degree: PhD, 2008, University of Western Australia

 [Truncated abstract] Genetic algorithms (GAs) have been extensively used and studied in computer science, yet there is no generally accepted methodology for exploring which parameters… (more)

Subjects/Keywords: Genetic algorithms; Computer algorithms; Statistical analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Czarn, A. S. T. (2008). Statistical exploratory analysis of genetic algorithms. (Doctoral Dissertation). University of Western Australia. Retrieved from http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=9580&local_base=GEN01-INS01

Chicago Manual of Style (16th Edition):

Czarn, Andrew Simon Timothy. “Statistical exploratory analysis of genetic algorithms.” 2008. Doctoral Dissertation, University of Western Australia. Accessed February 26, 2020. http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=9580&local_base=GEN01-INS01.

MLA Handbook (7th Edition):

Czarn, Andrew Simon Timothy. “Statistical exploratory analysis of genetic algorithms.” 2008. Web. 26 Feb 2020.

Vancouver:

Czarn AST. Statistical exploratory analysis of genetic algorithms. [Internet] [Doctoral dissertation]. University of Western Australia; 2008. [cited 2020 Feb 26]. Available from: http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=9580&local_base=GEN01-INS01.

Council of Science Editors:

Czarn AST. Statistical exploratory analysis of genetic algorithms. [Doctoral Dissertation]. University of Western Australia; 2008. Available from: http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=9580&local_base=GEN01-INS01


UCLA

13. Roytman, Alan James. Making Decisions Under Uncertainty for Large Data Domains.

Degree: Computer Science, 2014, UCLA

 In this thesis, we study key questions that touch upon many important problems in practice which are data-intensive. How can we process this influx of… (more)

Subjects/Keywords: Computer science; Online Algorithms; Streaming Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Roytman, A. J. (2014). Making Decisions Under Uncertainty for Large Data Domains. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/0x16r1xv

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

Roytman, Alan James. “Making Decisions Under Uncertainty for Large Data Domains.” 2014. Thesis, UCLA. Accessed February 26, 2020. http://www.escholarship.org/uc/item/0x16r1xv.

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

MLA Handbook (7th Edition):

Roytman, Alan James. “Making Decisions Under Uncertainty for Large Data Domains.” 2014. Web. 26 Feb 2020.

Vancouver:

Roytman AJ. Making Decisions Under Uncertainty for Large Data Domains. [Internet] [Thesis]. UCLA; 2014. [cited 2020 Feb 26]. Available from: http://www.escholarship.org/uc/item/0x16r1xv.

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

Council of Science Editors:

Roytman AJ. Making Decisions Under Uncertainty for Large Data Domains. [Thesis]. UCLA; 2014. Available from: http://www.escholarship.org/uc/item/0x16r1xv

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

14. Zhao, Yan. Accelerating betweenness centrality computation on heterogeneous processors.

Degree: 2014, Hong Kong University of Science and Technology

 The betweenness centrality (BC) measure of nodes in a graph is widely used in graph analysis. As both multicore CPUs and manycore GPUs are becoming… (more)

Subjects/Keywords: Graphics processing units ; Computer algorithms ; Parallel algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhao, Y. (2014). Accelerating betweenness centrality computation on heterogeneous processors. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-70599 ; https://doi.org/10.14711/thesis-b1301512 ; http://repository.ust.hk/ir/bitstream/1783.1-70599/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):

Zhao, Yan. “Accelerating betweenness centrality computation on heterogeneous processors.” 2014. Thesis, Hong Kong University of Science and Technology. Accessed February 26, 2020. http://repository.ust.hk/ir/Record/1783.1-70599 ; https://doi.org/10.14711/thesis-b1301512 ; http://repository.ust.hk/ir/bitstream/1783.1-70599/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):

Zhao, Yan. “Accelerating betweenness centrality computation on heterogeneous processors.” 2014. Web. 26 Feb 2020.

Vancouver:

Zhao Y. Accelerating betweenness centrality computation on heterogeneous processors. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2014. [cited 2020 Feb 26]. Available from: http://repository.ust.hk/ir/Record/1783.1-70599 ; https://doi.org/10.14711/thesis-b1301512 ; http://repository.ust.hk/ir/bitstream/1783.1-70599/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:

Zhao Y. Accelerating betweenness centrality computation on heterogeneous processors. [Thesis]. Hong Kong University of Science and Technology; 2014. Available from: http://repository.ust.hk/ir/Record/1783.1-70599 ; https://doi.org/10.14711/thesis-b1301512 ; http://repository.ust.hk/ir/bitstream/1783.1-70599/1/th_redirect.html

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


Penn State University

15. Dixit, Kashyap. Robust Models For Property Testing.

Degree: PhD, Computer Science and Engineering, 2015, Penn State University

 Property testing [Rubinfeld Sudan 96,Goldreich Goldwasser Ron 98] is a formal framework for studying approximate sublinear time randomized algorithms for decision problems. These algorithms have… (more)

Subjects/Keywords: Property Testing; Sublinear Algorithms; Randomized Algorithms; Approximation Algorithms; Theoretical Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dixit, K. (2015). Robust Models For Property Testing. (Doctoral Dissertation). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/27153

Chicago Manual of Style (16th Edition):

Dixit, Kashyap. “Robust Models For Property Testing.” 2015. Doctoral Dissertation, Penn State University. Accessed February 26, 2020. https://etda.libraries.psu.edu/catalog/27153.

MLA Handbook (7th Edition):

Dixit, Kashyap. “Robust Models For Property Testing.” 2015. Web. 26 Feb 2020.

Vancouver:

Dixit K. Robust Models For Property Testing. [Internet] [Doctoral dissertation]. Penn State University; 2015. [cited 2020 Feb 26]. Available from: https://etda.libraries.psu.edu/catalog/27153.

Council of Science Editors:

Dixit K. Robust Models For Property Testing. [Doctoral Dissertation]. Penn State University; 2015. Available from: https://etda.libraries.psu.edu/catalog/27153


University of Waterloo

16. McAulay, Caelyn Burnham. The Incremental Constraint of k-Server.

Degree: 2012, University of Waterloo

 Online algorithms are characterized by operating on an input sequence revealed over time versus a single static input. Instead of generating a single solution, they… (more)

Subjects/Keywords: computer science; algorithms; online algorithms; k-server; incremental algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

McAulay, C. B. (2012). The Incremental Constraint of k-Server. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6758

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

McAulay, Caelyn Burnham. “The Incremental Constraint of k-Server.” 2012. Thesis, University of Waterloo. Accessed February 26, 2020. http://hdl.handle.net/10012/6758.

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

MLA Handbook (7th Edition):

McAulay, Caelyn Burnham. “The Incremental Constraint of k-Server.” 2012. Web. 26 Feb 2020.

Vancouver:

McAulay CB. The Incremental Constraint of k-Server. [Internet] [Thesis]. University of Waterloo; 2012. [cited 2020 Feb 26]. Available from: http://hdl.handle.net/10012/6758.

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

Council of Science Editors:

McAulay CB. The Incremental Constraint of k-Server. [Thesis]. University of Waterloo; 2012. Available from: http://hdl.handle.net/10012/6758

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


Texas A&M University

17. Brammer, Grant. Algorithms for Searching and Analyzing Sets of Evolutionary Trees.

Degree: 2014, Texas A&M University

 The evolutionary relationships between organisms are represented as phylogenetic trees. These trees have important implications for understanding biodiversity, tracking disease, and designing medicine. Since the… (more)

Subjects/Keywords: computer science; phylogenetics; query; algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Brammer, G. (2014). Algorithms for Searching and Analyzing Sets of Evolutionary Trees. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/152770

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

Brammer, Grant. “Algorithms for Searching and Analyzing Sets of Evolutionary Trees.” 2014. Thesis, Texas A&M University. Accessed February 26, 2020. http://hdl.handle.net/1969.1/152770.

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

MLA Handbook (7th Edition):

Brammer, Grant. “Algorithms for Searching and Analyzing Sets of Evolutionary Trees.” 2014. Web. 26 Feb 2020.

Vancouver:

Brammer G. Algorithms for Searching and Analyzing Sets of Evolutionary Trees. [Internet] [Thesis]. Texas A&M University; 2014. [cited 2020 Feb 26]. Available from: http://hdl.handle.net/1969.1/152770.

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

Council of Science Editors:

Brammer G. Algorithms for Searching and Analyzing Sets of Evolutionary Trees. [Thesis]. Texas A&M University; 2014. Available from: http://hdl.handle.net/1969.1/152770

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


University of Hong Kong

18. Wang, Fu-lee. Efficient stabbing algorithms for a set of objects.

Degree: M. Phil., 1999, University of Hong Kong

published_or_final_version

Computer Science and Information Systems

Master

Master of Philosophy

Subjects/Keywords: Computer algorithms.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, F. (1999). Efficient stabbing algorithms for a set of objects. (Masters Thesis). University of Hong Kong. Retrieved from Wang, F. [王富利]. (1999). Efficient stabbing algorithms for a set of objects. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3122185 ; http://dx.doi.org/10.5353/th_b3122185 ; http://hdl.handle.net/10722/33253

Chicago Manual of Style (16th Edition):

Wang, Fu-lee. “Efficient stabbing algorithms for a set of objects.” 1999. Masters Thesis, University of Hong Kong. Accessed February 26, 2020. Wang, F. [王富利]. (1999). Efficient stabbing algorithms for a set of objects. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3122185 ; http://dx.doi.org/10.5353/th_b3122185 ; http://hdl.handle.net/10722/33253.

MLA Handbook (7th Edition):

Wang, Fu-lee. “Efficient stabbing algorithms for a set of objects.” 1999. Web. 26 Feb 2020.

Vancouver:

Wang F. Efficient stabbing algorithms for a set of objects. [Internet] [Masters thesis]. University of Hong Kong; 1999. [cited 2020 Feb 26]. Available from: Wang, F. [王富利]. (1999). Efficient stabbing algorithms for a set of objects. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3122185 ; http://dx.doi.org/10.5353/th_b3122185 ; http://hdl.handle.net/10722/33253.

Council of Science Editors:

Wang F. Efficient stabbing algorithms for a set of objects. [Masters Thesis]. University of Hong Kong; 1999. Available from: Wang, F. [王富利]. (1999). Efficient stabbing algorithms for a set of objects. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3122185 ; http://dx.doi.org/10.5353/th_b3122185 ; http://hdl.handle.net/10722/33253


University of Hong Kong

19. 劉興業; Lau, Hing-yip. The power of greediness: a general methodology for designing approximation algorithms.

Degree: M. Phil., 1999, University of Hong Kong

published_or_final_version

Computer Science and Information Systems

Master

Master of Philosophy

Subjects/Keywords: Computer algorithms.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

劉興業; Lau, H. (1999). The power of greediness: a general methodology for designing approximation algorithms. (Masters Thesis). University of Hong Kong. Retrieved from Lau, H. [劉興業]. (1999). The power of greediness : a general methodology for designing approximation algorithms. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3122117 ; http://dx.doi.org/10.5353/th_b3122117 ; http://hdl.handle.net/10722/33435

Chicago Manual of Style (16th Edition):

劉興業; Lau, Hing-yip. “The power of greediness: a general methodology for designing approximation algorithms.” 1999. Masters Thesis, University of Hong Kong. Accessed February 26, 2020. Lau, H. [劉興業]. (1999). The power of greediness : a general methodology for designing approximation algorithms. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3122117 ; http://dx.doi.org/10.5353/th_b3122117 ; http://hdl.handle.net/10722/33435.

MLA Handbook (7th Edition):

劉興業; Lau, Hing-yip. “The power of greediness: a general methodology for designing approximation algorithms.” 1999. Web. 26 Feb 2020.

Vancouver:

劉興業; Lau H. The power of greediness: a general methodology for designing approximation algorithms. [Internet] [Masters thesis]. University of Hong Kong; 1999. [cited 2020 Feb 26]. Available from: Lau, H. [劉興業]. (1999). The power of greediness : a general methodology for designing approximation algorithms. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3122117 ; http://dx.doi.org/10.5353/th_b3122117 ; http://hdl.handle.net/10722/33435.

Council of Science Editors:

劉興業; Lau H. The power of greediness: a general methodology for designing approximation algorithms. [Masters Thesis]. University of Hong Kong; 1999. Available from: Lau, H. [劉興業]. (1999). The power of greediness : a general methodology for designing approximation algorithms. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3122117 ; http://dx.doi.org/10.5353/th_b3122117 ; http://hdl.handle.net/10722/33435


University of Hong Kong

20. Tam, Siu-lung. Linear-size indexes for approximate pattern matching and dictionary matching.

Degree: PhD, 2010, University of Hong Kong

published_or_final_version

Computer Science

Doctoral

Doctor of Philosophy

Advisors/Committee Members: Lam, TW.

Subjects/Keywords: Computer algorithms.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tam, S. (2010). Linear-size indexes for approximate pattern matching and dictionary matching. (Doctoral Dissertation). University of Hong Kong. Retrieved from Tam, S. [譚小龍]. (2010). Linear-size indexes for approximate pattern matching and dictionary matching. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4420532 ; http://dx.doi.org/10.5353/th_b4420532 ; http://hdl.handle.net/10722/65311

Chicago Manual of Style (16th Edition):

Tam, Siu-lung. “Linear-size indexes for approximate pattern matching and dictionary matching.” 2010. Doctoral Dissertation, University of Hong Kong. Accessed February 26, 2020. Tam, S. [譚小龍]. (2010). Linear-size indexes for approximate pattern matching and dictionary matching. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4420532 ; http://dx.doi.org/10.5353/th_b4420532 ; http://hdl.handle.net/10722/65311.

MLA Handbook (7th Edition):

Tam, Siu-lung. “Linear-size indexes for approximate pattern matching and dictionary matching.” 2010. Web. 26 Feb 2020.

Vancouver:

Tam S. Linear-size indexes for approximate pattern matching and dictionary matching. [Internet] [Doctoral dissertation]. University of Hong Kong; 2010. [cited 2020 Feb 26]. Available from: Tam, S. [譚小龍]. (2010). Linear-size indexes for approximate pattern matching and dictionary matching. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4420532 ; http://dx.doi.org/10.5353/th_b4420532 ; http://hdl.handle.net/10722/65311.

Council of Science Editors:

Tam S. Linear-size indexes for approximate pattern matching and dictionary matching. [Doctoral Dissertation]. University of Hong Kong; 2010. Available from: Tam, S. [譚小龍]. (2010). Linear-size indexes for approximate pattern matching and dictionary matching. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4420532 ; http://dx.doi.org/10.5353/th_b4420532 ; http://hdl.handle.net/10722/65311


University of Hong Kong

21. Fok, Chi-wai. Better algorithms for comparing trees.

Degree: M. Phil., 2010, University of Hong Kong

published_or_final_version

Computer Science

Master

Master of Philosophy

Advisors/Committee Members: Ting, HF.

Subjects/Keywords: Computer algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fok, C. (2010). Better algorithms for comparing trees. (Masters Thesis). University of Hong Kong. Retrieved from Fok, C. [霍志偉]. (2010). Better algorithms for comparing trees. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4451967 ; http://dx.doi.org/10.5353/th_b4451967 ; http://hdl.handle.net/10722/128699

Chicago Manual of Style (16th Edition):

Fok, Chi-wai. “Better algorithms for comparing trees.” 2010. Masters Thesis, University of Hong Kong. Accessed February 26, 2020. Fok, C. [霍志偉]. (2010). Better algorithms for comparing trees. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4451967 ; http://dx.doi.org/10.5353/th_b4451967 ; http://hdl.handle.net/10722/128699.

MLA Handbook (7th Edition):

Fok, Chi-wai. “Better algorithms for comparing trees.” 2010. Web. 26 Feb 2020.

Vancouver:

Fok C. Better algorithms for comparing trees. [Internet] [Masters thesis]. University of Hong Kong; 2010. [cited 2020 Feb 26]. Available from: Fok, C. [霍志偉]. (2010). Better algorithms for comparing trees. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4451967 ; http://dx.doi.org/10.5353/th_b4451967 ; http://hdl.handle.net/10722/128699.

Council of Science Editors:

Fok C. Better algorithms for comparing trees. [Masters Thesis]. University of Hong Kong; 2010. Available from: Fok, C. [霍志偉]. (2010). Better algorithms for comparing trees. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4451967 ; http://dx.doi.org/10.5353/th_b4451967 ; http://hdl.handle.net/10722/128699

22. Mani, K. Evolution of unified framework for run time optimization and security enhancement in cryptographic algorithms; -.

Degree: Computer Science, 2012, Bharathidasan University

With the rapid usage of data communication, security is becoming a more crucial issue. The fundamental requirements for security include authentication, confidentiality, integrity, and non-repudiation.… (more)

Subjects/Keywords: Computer Science; Cryptography; Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mani, K. (2012). Evolution of unified framework for run time optimization and security enhancement in cryptographic algorithms; -. (Thesis). Bharathidasan University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/9531

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

Mani, K. “Evolution of unified framework for run time optimization and security enhancement in cryptographic algorithms; -.” 2012. Thesis, Bharathidasan University. Accessed February 26, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/9531.

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

MLA Handbook (7th Edition):

Mani, K. “Evolution of unified framework for run time optimization and security enhancement in cryptographic algorithms; -.” 2012. Web. 26 Feb 2020.

Vancouver:

Mani K. Evolution of unified framework for run time optimization and security enhancement in cryptographic algorithms; -. [Internet] [Thesis]. Bharathidasan University; 2012. [cited 2020 Feb 26]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/9531.

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

Council of Science Editors:

Mani K. Evolution of unified framework for run time optimization and security enhancement in cryptographic algorithms; -. [Thesis]. Bharathidasan University; 2012. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/9531

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


University of Johannesburg

23. Leenen, Louise. Contributions towards an implementation of a branch-and-cut algorithm for the travelling salesman problem.

Degree: 2014, University of Johannesburg

M.Sc. (Computer Science)

The STSP (symmetric travelling salesman problem) involves finding the cheapest tour through a number of cities. It is a difficult problem and… (more)

Subjects/Keywords: Computer algorithms; Traveling-salesman problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Leenen, L. (2014). Contributions towards an implementation of a branch-and-cut algorithm for the travelling salesman problem. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/12237

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

Leenen, Louise. “Contributions towards an implementation of a branch-and-cut algorithm for the travelling salesman problem.” 2014. Thesis, University of Johannesburg. Accessed February 26, 2020. http://hdl.handle.net/10210/12237.

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

MLA Handbook (7th Edition):

Leenen, Louise. “Contributions towards an implementation of a branch-and-cut algorithm for the travelling salesman problem.” 2014. Web. 26 Feb 2020.

Vancouver:

Leenen L. Contributions towards an implementation of a branch-and-cut algorithm for the travelling salesman problem. [Internet] [Thesis]. University of Johannesburg; 2014. [cited 2020 Feb 26]. Available from: http://hdl.handle.net/10210/12237.

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

Council of Science Editors:

Leenen L. Contributions towards an implementation of a branch-and-cut algorithm for the travelling salesman problem. [Thesis]. University of Johannesburg; 2014. Available from: http://hdl.handle.net/10210/12237

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


University of Johannesburg

24. Geldenhuys, Christel Erna. An implementation of a branch-and-cut algorithm for the travelling salesman problem.

Degree: 2012, University of Johannesburg

M.Sc. (Computer Science)

The Travelling Salesman Problem (TSP) comprises the following: A salesman is required, by definition of his job description, to visit a set… (more)

Subjects/Keywords: Traveling-salesman problem; Computer algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Geldenhuys, C. E. (2012). An implementation of a branch-and-cut algorithm for the travelling salesman problem. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/7337

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

Geldenhuys, Christel Erna. “An implementation of a branch-and-cut algorithm for the travelling salesman problem.” 2012. Thesis, University of Johannesburg. Accessed February 26, 2020. http://hdl.handle.net/10210/7337.

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

MLA Handbook (7th Edition):

Geldenhuys, Christel Erna. “An implementation of a branch-and-cut algorithm for the travelling salesman problem.” 2012. Web. 26 Feb 2020.

Vancouver:

Geldenhuys CE. An implementation of a branch-and-cut algorithm for the travelling salesman problem. [Internet] [Thesis]. University of Johannesburg; 2012. [cited 2020 Feb 26]. Available from: http://hdl.handle.net/10210/7337.

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

Council of Science Editors:

Geldenhuys CE. An implementation of a branch-and-cut algorithm for the travelling salesman problem. [Thesis]. University of Johannesburg; 2012. Available from: http://hdl.handle.net/10210/7337

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


Brock University

25. Li, Yifeng. Properties and algorithms of the (n, k)-arrangement graphs .

Degree: Department of Computer Science, 2010, Brock University

 The (n, k)-arrangement interconnection topology was first introduced in 1992. The (n, k )-arrangement graph is a class of generalized star graphs. Compared with the… (more)

Subjects/Keywords: Topological graph theory.; Computer algorithms.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, Y. (2010). Properties and algorithms of the (n, k)-arrangement graphs . (Thesis). Brock University. Retrieved from http://hdl.handle.net/10464/2950

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, Yifeng. “Properties and algorithms of the (n, k)-arrangement graphs .” 2010. Thesis, Brock University. Accessed February 26, 2020. http://hdl.handle.net/10464/2950.

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

MLA Handbook (7th Edition):

Li, Yifeng. “Properties and algorithms of the (n, k)-arrangement graphs .” 2010. Web. 26 Feb 2020.

Vancouver:

Li Y. Properties and algorithms of the (n, k)-arrangement graphs . [Internet] [Thesis]. Brock University; 2010. [cited 2020 Feb 26]. Available from: http://hdl.handle.net/10464/2950.

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

Council of Science Editors:

Li Y. Properties and algorithms of the (n, k)-arrangement graphs . [Thesis]. Brock University; 2010. Available from: http://hdl.handle.net/10464/2950

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


Brock University

26. Yin, Xiang. Quadtree representation and compression of spatial data .

Degree: Department of Computer Science, 2010, Brock University

 Spatial data representation and compression has become a focus issue in computer graphics and image processing applications. Quadtrees, as one of hierarchical data structures, basing… (more)

Subjects/Keywords: Spatial data infrastructures; Computer algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yin, X. (2010). Quadtree representation and compression of spatial data . (Thesis). Brock University. Retrieved from http://hdl.handle.net/10464/2952

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

Yin, Xiang. “Quadtree representation and compression of spatial data .” 2010. Thesis, Brock University. Accessed February 26, 2020. http://hdl.handle.net/10464/2952.

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

MLA Handbook (7th Edition):

Yin, Xiang. “Quadtree representation and compression of spatial data .” 2010. Web. 26 Feb 2020.

Vancouver:

Yin X. Quadtree representation and compression of spatial data . [Internet] [Thesis]. Brock University; 2010. [cited 2020 Feb 26]. Available from: http://hdl.handle.net/10464/2952.

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

Council of Science Editors:

Yin X. Quadtree representation and compression of spatial data . [Thesis]. Brock University; 2010. Available from: http://hdl.handle.net/10464/2952

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


RMIT University

27. Bird, S. Adaptive techniques for enhancing the robustness and performance of speciated PSOs in multimodal environments.

Degree: 2008, RMIT University

 This thesis proposes several new techniques to improve the performance of speciated particle swarms in multimodal environments. We investigate how these algorithms can become more… (more)

Subjects/Keywords: Fields of Research; Computer algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bird, S. (2008). Adaptive techniques for enhancing the robustness and performance of speciated PSOs in multimodal environments. (Thesis). RMIT University. Retrieved from http://researchbank.rmit.edu.au/view/rmit:6619

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

Bird, S. “Adaptive techniques for enhancing the robustness and performance of speciated PSOs in multimodal environments.” 2008. Thesis, RMIT University. Accessed February 26, 2020. http://researchbank.rmit.edu.au/view/rmit:6619.

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

MLA Handbook (7th Edition):

Bird, S. “Adaptive techniques for enhancing the robustness and performance of speciated PSOs in multimodal environments.” 2008. Web. 26 Feb 2020.

Vancouver:

Bird S. Adaptive techniques for enhancing the robustness and performance of speciated PSOs in multimodal environments. [Internet] [Thesis]. RMIT University; 2008. [cited 2020 Feb 26]. Available from: http://researchbank.rmit.edu.au/view/rmit:6619.

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

Council of Science Editors:

Bird S. Adaptive techniques for enhancing the robustness and performance of speciated PSOs in multimodal environments. [Thesis]. RMIT University; 2008. Available from: http://researchbank.rmit.edu.au/view/rmit:6619

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


Oregon State University

28. Amoth, Thomas R. Exact learning of tree patterns.

Degree: PhD, Computer Science, 2001, Oregon State University

 Tree patterns are natural candidates for representing rules and hypotheses in many tasks such as information extraction and symbolic mathematics. A tree pattern is a… (more)

Subjects/Keywords: Computer algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Amoth, T. R. (2001). Exact learning of tree patterns. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/11820

Chicago Manual of Style (16th Edition):

Amoth, Thomas R. “Exact learning of tree patterns.” 2001. Doctoral Dissertation, Oregon State University. Accessed February 26, 2020. http://hdl.handle.net/1957/11820.

MLA Handbook (7th Edition):

Amoth, Thomas R. “Exact learning of tree patterns.” 2001. Web. 26 Feb 2020.

Vancouver:

Amoth TR. Exact learning of tree patterns. [Internet] [Doctoral dissertation]. Oregon State University; 2001. [cited 2020 Feb 26]. Available from: http://hdl.handle.net/1957/11820.

Council of Science Editors:

Amoth TR. Exact learning of tree patterns. [Doctoral Dissertation]. Oregon State University; 2001. Available from: http://hdl.handle.net/1957/11820


University of Victoria

29. Younis, Adel Ayad Hassouna. Space exploration and region elimination global optimization algorithms for multidisciplinary design optimization.

Degree: Dept. of Mechanical Engineering, 2011, University of Victoria

 In modern day engineering, the designer has become more and more dependent on computer simulation. Oftentimes, computational cost and convergence accuracy accompany these simulations to… (more)

Subjects/Keywords: approximation models; computer simulation; algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Younis, A. A. H. (2011). Space exploration and region elimination global optimization algorithms for multidisciplinary design optimization. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/3325

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

Younis, Adel Ayad Hassouna. “Space exploration and region elimination global optimization algorithms for multidisciplinary design optimization.” 2011. Thesis, University of Victoria. Accessed February 26, 2020. http://hdl.handle.net/1828/3325.

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

MLA Handbook (7th Edition):

Younis, Adel Ayad Hassouna. “Space exploration and region elimination global optimization algorithms for multidisciplinary design optimization.” 2011. Web. 26 Feb 2020.

Vancouver:

Younis AAH. Space exploration and region elimination global optimization algorithms for multidisciplinary design optimization. [Internet] [Thesis]. University of Victoria; 2011. [cited 2020 Feb 26]. Available from: http://hdl.handle.net/1828/3325.

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

Council of Science Editors:

Younis AAH. Space exploration and region elimination global optimization algorithms for multidisciplinary design optimization. [Thesis]. University of Victoria; 2011. Available from: http://hdl.handle.net/1828/3325

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


Clemson University

30. Moser, Scott. DOWNSTREAM RESOURCE ALLOCATION IN DOCSIS 3.0 CHANNEL BONDED NETWORKS.

Degree: PhD, Computer Science, 2011, Clemson University

 Modern broadband internet access cable systems follow the Data Over Cable System Interface Specification (DOCSIS) for data transfer between the individual cable modem (CM) and… (more)

Subjects/Keywords: Algorithms; Networking; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Moser, S. (2011). DOWNSTREAM RESOURCE ALLOCATION IN DOCSIS 3.0 CHANNEL BONDED NETWORKS. (Doctoral Dissertation). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_dissertations/780

Chicago Manual of Style (16th Edition):

Moser, Scott. “DOWNSTREAM RESOURCE ALLOCATION IN DOCSIS 3.0 CHANNEL BONDED NETWORKS.” 2011. Doctoral Dissertation, Clemson University. Accessed February 26, 2020. https://tigerprints.clemson.edu/all_dissertations/780.

MLA Handbook (7th Edition):

Moser, Scott. “DOWNSTREAM RESOURCE ALLOCATION IN DOCSIS 3.0 CHANNEL BONDED NETWORKS.” 2011. Web. 26 Feb 2020.

Vancouver:

Moser S. DOWNSTREAM RESOURCE ALLOCATION IN DOCSIS 3.0 CHANNEL BONDED NETWORKS. [Internet] [Doctoral dissertation]. Clemson University; 2011. [cited 2020 Feb 26]. Available from: https://tigerprints.clemson.edu/all_dissertations/780.

Council of Science Editors:

Moser S. DOWNSTREAM RESOURCE ALLOCATION IN DOCSIS 3.0 CHANNEL BONDED NETWORKS. [Doctoral Dissertation]. Clemson University; 2011. Available from: https://tigerprints.clemson.edu/all_dissertations/780

[1] [2] [3] [4] [5] … [69]

.