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:( Hill Climbing). Showing records 1 – 30 of 33 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Brunel University

1. Hassan, Fadratul Hafinaz. Heuristic search methods and cellular automata modelling for layout design.

Degree: PhD, 2013, Brunel University

 Spatial layout design must consider not only ease of movement for pedestrians under normal conditions, but also their safety in panic situations, such as an… (more)

Subjects/Keywords: 006.3; Simulated annealing; Hill climbing; Genetic algorithm; Pedestrian simulation; Spatial

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hassan, F. H. (2013). Heuristic search methods and cellular automata modelling for layout design. (Doctoral Dissertation). Brunel University. Retrieved from http://bura.brunel.ac.uk/handle/2438/7581 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.575676

Chicago Manual of Style (16th Edition):

Hassan, Fadratul Hafinaz. “Heuristic search methods and cellular automata modelling for layout design.” 2013. Doctoral Dissertation, Brunel University. Accessed October 26, 2020. http://bura.brunel.ac.uk/handle/2438/7581 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.575676.

MLA Handbook (7th Edition):

Hassan, Fadratul Hafinaz. “Heuristic search methods and cellular automata modelling for layout design.” 2013. Web. 26 Oct 2020.

Vancouver:

Hassan FH. Heuristic search methods and cellular automata modelling for layout design. [Internet] [Doctoral dissertation]. Brunel University; 2013. [cited 2020 Oct 26]. Available from: http://bura.brunel.ac.uk/handle/2438/7581 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.575676.

Council of Science Editors:

Hassan FH. Heuristic search methods and cellular automata modelling for layout design. [Doctoral Dissertation]. Brunel University; 2013. Available from: http://bura.brunel.ac.uk/handle/2438/7581 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.575676


Universidade Nova

2. Lameiro, José David Lopes. Projecto de um circuito conversor DC-DC para aplicações de “energy harvest”.

Degree: 2011, Universidade Nova

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para a obtenção do grau de Mestre em Engenharia Electrotécnica e de… (more)

Subjects/Keywords: Energy harvesting; Conversor DC/DC; Baixa potência; CMOS; Load voltage maximization; Hill Climbing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lameiro, J. D. L. (2011). Projecto de um circuito conversor DC-DC para aplicações de “energy harvest”. (Thesis). Universidade Nova. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/5897

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

Lameiro, José David Lopes. “Projecto de um circuito conversor DC-DC para aplicações de “energy harvest”.” 2011. Thesis, Universidade Nova. Accessed October 26, 2020. http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/5897.

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

MLA Handbook (7th Edition):

Lameiro, José David Lopes. “Projecto de um circuito conversor DC-DC para aplicações de “energy harvest”.” 2011. Web. 26 Oct 2020.

Vancouver:

Lameiro JDL. Projecto de um circuito conversor DC-DC para aplicações de “energy harvest”. [Internet] [Thesis]. Universidade Nova; 2011. [cited 2020 Oct 26]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/5897.

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

Council of Science Editors:

Lameiro JDL. Projecto de um circuito conversor DC-DC para aplicações de “energy harvest”. [Thesis]. Universidade Nova; 2011. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/5897

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

3. Manshouri, Reza. Edge Ratchet and Simulated Annealing to Improve RF Score of the Supertree of Life.

Degree: MS, Computer Science, 2017, Texas A&M University

 Constructing the Supertree of Life can provide crucially valuable knowledge to address many critical contemporary challenges such as fighting diseases, improving global agriculture, and protecting… (more)

Subjects/Keywords: phylogenetic; hill-climbing; simulated annealing; NP-hard

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Manshouri, R. (2017). Edge Ratchet and Simulated Annealing to Improve RF Score of the Supertree of Life. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/169652

Chicago Manual of Style (16th Edition):

Manshouri, Reza. “Edge Ratchet and Simulated Annealing to Improve RF Score of the Supertree of Life.” 2017. Masters Thesis, Texas A&M University. Accessed October 26, 2020. http://hdl.handle.net/1969.1/169652.

MLA Handbook (7th Edition):

Manshouri, Reza. “Edge Ratchet and Simulated Annealing to Improve RF Score of the Supertree of Life.” 2017. Web. 26 Oct 2020.

Vancouver:

Manshouri R. Edge Ratchet and Simulated Annealing to Improve RF Score of the Supertree of Life. [Internet] [Masters thesis]. Texas A&M University; 2017. [cited 2020 Oct 26]. Available from: http://hdl.handle.net/1969.1/169652.

Council of Science Editors:

Manshouri R. Edge Ratchet and Simulated Annealing to Improve RF Score of the Supertree of Life. [Masters Thesis]. Texas A&M University; 2017. Available from: http://hdl.handle.net/1969.1/169652


University of South Florida

4. Malleypally, Vinaya. Parallelizing Tabu Search Based Optimization Algorithm on GPUs.

Degree: 2018, University of South Florida

 There are many combinatorial optimization problems such as traveling salesman problem, quadratic-assignment problem, flow shop scheduling, that are computationally intractable. Tabu search based simulated annealing… (more)

Subjects/Keywords: Hill Climbing; Simulated Annealing; Parallel Computing; CUDA; Tabu List; Aspiration Criteria; Neighborhood Search; Global Optimum; Local Minima; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Malleypally, V. (2018). Parallelizing Tabu Search Based Optimization Algorithm on GPUs. (Thesis). University of South Florida. Retrieved from https://scholarcommons.usf.edu/etd/7638

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

Malleypally, Vinaya. “Parallelizing Tabu Search Based Optimization Algorithm on GPUs.” 2018. Thesis, University of South Florida. Accessed October 26, 2020. https://scholarcommons.usf.edu/etd/7638.

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

MLA Handbook (7th Edition):

Malleypally, Vinaya. “Parallelizing Tabu Search Based Optimization Algorithm on GPUs.” 2018. Web. 26 Oct 2020.

Vancouver:

Malleypally V. Parallelizing Tabu Search Based Optimization Algorithm on GPUs. [Internet] [Thesis]. University of South Florida; 2018. [cited 2020 Oct 26]. Available from: https://scholarcommons.usf.edu/etd/7638.

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

Council of Science Editors:

Malleypally V. Parallelizing Tabu Search Based Optimization Algorithm on GPUs. [Thesis]. University of South Florida; 2018. Available from: https://scholarcommons.usf.edu/etd/7638

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

5. BORGIANI, Felipe Silveira Mello. Pilgrim: um sistema para geração e classificação de rotas de ônibus sensível ao contexto .

Degree: 2013, Universidade Federal de Pernambuco

 O trânsito caótico das grandes cidades, especialmente em países em desenvolvimento, impacta diretamente na qualidade de vida dos cidadãos, principalmente daqueles que necessitam diariamente dos… (more)

Subjects/Keywords: Sistemas de transporte inteligente (ITS); Sistemas avançados de transporte público (APTS); Sistemas de planejamento de viagens; Contexto Computacional; UbiBus; Hill-Climbing; Algoritmos genéticos

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

BORGIANI, F. S. M. (2013). Pilgrim: um sistema para geração e classificação de rotas de ônibus sensível ao contexto . (Thesis). Universidade Federal de Pernambuco. Retrieved from http://repositorio.ufpe.br/handle/123456789/11983

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

BORGIANI, Felipe Silveira Mello. “Pilgrim: um sistema para geração e classificação de rotas de ônibus sensível ao contexto .” 2013. Thesis, Universidade Federal de Pernambuco. Accessed October 26, 2020. http://repositorio.ufpe.br/handle/123456789/11983.

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

MLA Handbook (7th Edition):

BORGIANI, Felipe Silveira Mello. “Pilgrim: um sistema para geração e classificação de rotas de ônibus sensível ao contexto .” 2013. Web. 26 Oct 2020.

Vancouver:

BORGIANI FSM. Pilgrim: um sistema para geração e classificação de rotas de ônibus sensível ao contexto . [Internet] [Thesis]. Universidade Federal de Pernambuco; 2013. [cited 2020 Oct 26]. Available from: http://repositorio.ufpe.br/handle/123456789/11983.

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

Council of Science Editors:

BORGIANI FSM. Pilgrim: um sistema para geração e classificação de rotas de ônibus sensível ao contexto . [Thesis]. Universidade Federal de Pernambuco; 2013. Available from: http://repositorio.ufpe.br/handle/123456789/11983

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

6. Karhi, David. Caching In Iterative Hill Climbing.

Degree: 2013

Subjects/Keywords: Caching; Hill climbing; Optimization; Time/space trade-offs; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Karhi, D. (2013). Caching In Iterative Hill Climbing. (Thesis). [No school.] Retrieved from http://hdl.handle.net/2249.1/62488

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

Chicago Manual of Style (16th Edition):

Karhi, David. “Caching In Iterative Hill Climbing.” 2013. Thesis, [No school]. Accessed October 26, 2020. http://hdl.handle.net/2249.1/62488.

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

MLA Handbook (7th Edition):

Karhi, David. “Caching In Iterative Hill Climbing.” 2013. Web. 26 Oct 2020.

Vancouver:

Karhi D. Caching In Iterative Hill Climbing. [Internet] [Thesis]. [No school]; 2013. [cited 2020 Oct 26]. Available from: http://hdl.handle.net/2249.1/62488.

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

Council of Science Editors:

Karhi D. Caching In Iterative Hill Climbing. [Thesis]. [No school]; 2013. Available from: http://hdl.handle.net/2249.1/62488

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


Universidade Nova

7. Passos, Carlos Eduardo Correia de. Elaboração de Horários Académicos.

Degree: 2017, Universidade Nova

 A geração de horários é uma tarefa de dificuldade elevada e requer trabalho árduo devido à necessidade de gerir os diversos conflitos de restrições impostos… (more)

Subjects/Keywords: Horários Académicos; Benchmarking; Formato em XML; Pesquisa Local; Hill-Climbing; Simulated Annealing; Domínio/Área Científica::Engenharia e Tecnologia::Engenharia Eletrotécnica, Eletrónica e Informática

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Passos, C. E. C. d. (2017). Elaboração de Horários Académicos. (Thesis). Universidade Nova. Retrieved from https://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/24098

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

Passos, Carlos Eduardo Correia de. “Elaboração de Horários Académicos.” 2017. Thesis, Universidade Nova. Accessed October 26, 2020. https://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/24098.

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

MLA Handbook (7th Edition):

Passos, Carlos Eduardo Correia de. “Elaboração de Horários Académicos.” 2017. Web. 26 Oct 2020.

Vancouver:

Passos CECd. Elaboração de Horários Académicos. [Internet] [Thesis]. Universidade Nova; 2017. [cited 2020 Oct 26]. Available from: https://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/24098.

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

Council of Science Editors:

Passos CECd. Elaboração de Horários Académicos. [Thesis]. Universidade Nova; 2017. Available from: https://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/24098

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


Texas State University – San Marcos

8. Karhi, David. Caching In Iterative Hill Climbing.

Degree: MS, Computer Science, 2008, Texas State University – San Marcos

No abstract prepared. Advisors/Committee Members: Tamir, Dan (advisor), Peng, Wuxu (committee member), Geerts, Wilhelmus (committee member).

Subjects/Keywords: Caching; Hill climbing; Optimization; Time/space trade-offs; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Karhi, D. (2008). Caching In Iterative Hill Climbing. (Masters Thesis). Texas State University – San Marcos. Retrieved from https://digital.library.txstate.edu/handle/10877/3908

Chicago Manual of Style (16th Edition):

Karhi, David. “Caching In Iterative Hill Climbing.” 2008. Masters Thesis, Texas State University – San Marcos. Accessed October 26, 2020. https://digital.library.txstate.edu/handle/10877/3908.

MLA Handbook (7th Edition):

Karhi, David. “Caching In Iterative Hill Climbing.” 2008. Web. 26 Oct 2020.

Vancouver:

Karhi D. Caching In Iterative Hill Climbing. [Internet] [Masters thesis]. Texas State University – San Marcos; 2008. [cited 2020 Oct 26]. Available from: https://digital.library.txstate.edu/handle/10877/3908.

Council of Science Editors:

Karhi D. Caching In Iterative Hill Climbing. [Masters Thesis]. Texas State University – San Marcos; 2008. Available from: https://digital.library.txstate.edu/handle/10877/3908


Lincoln University

9. Foster, Roland J. "It lets you use your feet more like you use your hands on the rock" : a haptic geography of bouldering.

Degree: 2007, Lincoln University

 This dissertation presents the results of an exploratory study of the ways boulderers have developed unique haptic skills during the practice of bouldering at Castle… (more)

Subjects/Keywords: bouldering; haptic skills; rock climbing; Castle Hill; ecological perception; whole body; 160402 Recreation, Leisure and Tourism Geography; 1604 Human Geography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Foster, R. J. (2007). "It lets you use your feet more like you use your hands on the rock" : a haptic geography of bouldering. (Thesis). Lincoln University. Retrieved from http://hdl.handle.net/10182/2717

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

Foster, Roland J. “"It lets you use your feet more like you use your hands on the rock" : a haptic geography of bouldering.” 2007. Thesis, Lincoln University. Accessed October 26, 2020. http://hdl.handle.net/10182/2717.

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

MLA Handbook (7th Edition):

Foster, Roland J. “"It lets you use your feet more like you use your hands on the rock" : a haptic geography of bouldering.” 2007. Web. 26 Oct 2020.

Vancouver:

Foster RJ. "It lets you use your feet more like you use your hands on the rock" : a haptic geography of bouldering. [Internet] [Thesis]. Lincoln University; 2007. [cited 2020 Oct 26]. Available from: http://hdl.handle.net/10182/2717.

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

Council of Science Editors:

Foster RJ. "It lets you use your feet more like you use your hands on the rock" : a haptic geography of bouldering. [Thesis]. Lincoln University; 2007. Available from: http://hdl.handle.net/10182/2717

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


Lincoln University

10. Barnett, Shaun C. Castle Hill rock climbing: a case study of a recreation versus preservation conflict.

Degree: 1991, Lincoln University

 Castle Hill basin is a unique area of limestone tors in the Broken River catchment of Canterbury. The limestone provides specialised habitats for a number… (more)

Subjects/Keywords: Castle Hill; rock climbing; recreation; preservation; conflict; 160402 Recreation, Leisure and Tourism Geography; 050205 Environmental Management

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Barnett, S. C. (1991). Castle Hill rock climbing: a case study of a recreation versus preservation conflict. (Thesis). Lincoln University. Retrieved from http://hdl.handle.net/10182/3568

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

Barnett, Shaun C. “Castle Hill rock climbing: a case study of a recreation versus preservation conflict.” 1991. Thesis, Lincoln University. Accessed October 26, 2020. http://hdl.handle.net/10182/3568.

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

MLA Handbook (7th Edition):

Barnett, Shaun C. “Castle Hill rock climbing: a case study of a recreation versus preservation conflict.” 1991. Web. 26 Oct 2020.

Vancouver:

Barnett SC. Castle Hill rock climbing: a case study of a recreation versus preservation conflict. [Internet] [Thesis]. Lincoln University; 1991. [cited 2020 Oct 26]. Available from: http://hdl.handle.net/10182/3568.

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

Council of Science Editors:

Barnett SC. Castle Hill rock climbing: a case study of a recreation versus preservation conflict. [Thesis]. Lincoln University; 1991. Available from: http://hdl.handle.net/10182/3568

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

11. Boudjelaba, Kamal. Contribution à la conception des filtres bidimensionnels non récursifs en utilisant les techniques de l’intelligence artificielle : application au traitement d’images : Contribution to the design of two-dimensional non-recursive filters using artificial intelligence techniques : application to image processing.

Degree: Docteur es, Electronique, 2014, Orléans; Université Ferhat Abbas (Sétif, Algérie)

La conception des filtres a réponse impulsionnelle finie (RIF) peut être formulée comme un problème d'optimisation non linéaire réputé pour être difficile sa résolution par… (more)

Subjects/Keywords: Filtres RIF 1D et 2D; Algorithme génétique; Optimisation par essaim de particules; Hybridation; Recherche Tabou; Recuit simulé; Ascension de collines; Traitement d’images; 1D and 2D FIR filters; Genetic algorithm; Particles swarm optimization; Hybridization; Tabu Search; Simulated annealing; Hill climbing; Image processing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Boudjelaba, K. (2014). Contribution à la conception des filtres bidimensionnels non récursifs en utilisant les techniques de l’intelligence artificielle : application au traitement d’images : Contribution to the design of two-dimensional non-recursive filters using artificial intelligence techniques : application to image processing. (Doctoral Dissertation). Orléans; Université Ferhat Abbas (Sétif, Algérie). Retrieved from http://www.theses.fr/2014ORLE2015

Chicago Manual of Style (16th Edition):

Boudjelaba, Kamal. “Contribution à la conception des filtres bidimensionnels non récursifs en utilisant les techniques de l’intelligence artificielle : application au traitement d’images : Contribution to the design of two-dimensional non-recursive filters using artificial intelligence techniques : application to image processing.” 2014. Doctoral Dissertation, Orléans; Université Ferhat Abbas (Sétif, Algérie). Accessed October 26, 2020. http://www.theses.fr/2014ORLE2015.

MLA Handbook (7th Edition):

Boudjelaba, Kamal. “Contribution à la conception des filtres bidimensionnels non récursifs en utilisant les techniques de l’intelligence artificielle : application au traitement d’images : Contribution to the design of two-dimensional non-recursive filters using artificial intelligence techniques : application to image processing.” 2014. Web. 26 Oct 2020.

Vancouver:

Boudjelaba K. Contribution à la conception des filtres bidimensionnels non récursifs en utilisant les techniques de l’intelligence artificielle : application au traitement d’images : Contribution to the design of two-dimensional non-recursive filters using artificial intelligence techniques : application to image processing. [Internet] [Doctoral dissertation]. Orléans; Université Ferhat Abbas (Sétif, Algérie); 2014. [cited 2020 Oct 26]. Available from: http://www.theses.fr/2014ORLE2015.

Council of Science Editors:

Boudjelaba K. Contribution à la conception des filtres bidimensionnels non récursifs en utilisant les techniques de l’intelligence artificielle : application au traitement d’images : Contribution to the design of two-dimensional non-recursive filters using artificial intelligence techniques : application to image processing. [Doctoral Dissertation]. Orléans; Université Ferhat Abbas (Sétif, Algérie); 2014. Available from: http://www.theses.fr/2014ORLE2015

12. TORRES PEREZ, OSCAR IVAN. Evaluación de técnicas de control de MPPT para sistema fotovoltaico en Cundinamarca .

Degree: 2016, Universidad de los Andes

Simulación y comparación de cuatro técnicas de control aplicadas al problema de seguimiento del punto máximo de potencia (MPPT) bajo dos criterios de desempeño: Integral Absolute Error (IAE) y eficiencia, para condiciones constantes y variables de irradiancia. Advisors/Committee Members: Quijano Silva Nicanor (advisor).

Subjects/Keywords: Maximum Power Point Tracking; Hill Climbing; Incremental Conductance; Fuzzy Logic Control; Extremum Seeking Control; Boost Converter

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

TORRES PEREZ, O. I. (2016). Evaluación de técnicas de control de MPPT para sistema fotovoltaico en Cundinamarca . (Thesis). Universidad de los Andes. Retrieved from https://documentodegrado.uniandes.edu.co/documentos/9294.pdf

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

TORRES PEREZ, OSCAR IVAN. “Evaluación de técnicas de control de MPPT para sistema fotovoltaico en Cundinamarca .” 2016. Thesis, Universidad de los Andes. Accessed October 26, 2020. https://documentodegrado.uniandes.edu.co/documentos/9294.pdf.

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

MLA Handbook (7th Edition):

TORRES PEREZ, OSCAR IVAN. “Evaluación de técnicas de control de MPPT para sistema fotovoltaico en Cundinamarca .” 2016. Web. 26 Oct 2020.

Vancouver:

TORRES PEREZ OI. Evaluación de técnicas de control de MPPT para sistema fotovoltaico en Cundinamarca . [Internet] [Thesis]. Universidad de los Andes; 2016. [cited 2020 Oct 26]. Available from: https://documentodegrado.uniandes.edu.co/documentos/9294.pdf.

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

Council of Science Editors:

TORRES PEREZ OI. Evaluación de técnicas de control de MPPT para sistema fotovoltaico en Cundinamarca . [Thesis]. Universidad de los Andes; 2016. Available from: https://documentodegrado.uniandes.edu.co/documentos/9294.pdf

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


Queensland University of Technology

13. Burnett, Linda Dee. Heuristic Optimization of Boolean Functions and Substitution Boxes for Cryptography.

Degree: 2005, Queensland University of Technology

 Fundamental to the electronic security of information and communication systems, is the correct use and application of appropriate ciphers. The strength of these ciphers, particularly… (more)

Subjects/Keywords: boolean function; substitution box; heuristic techniques; Genetic Algorithm; Hill Climbing; cryptographic properties; autocorrelation; balance; nonlinearity; correlation immunity; resilience; propagation criteria

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Burnett, L. D. (2005). Heuristic Optimization of Boolean Functions and Substitution Boxes for Cryptography. (Thesis). Queensland University of Technology. Retrieved from https://eprints.qut.edu.au/16023/

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

Burnett, Linda Dee. “Heuristic Optimization of Boolean Functions and Substitution Boxes for Cryptography.” 2005. Thesis, Queensland University of Technology. Accessed October 26, 2020. https://eprints.qut.edu.au/16023/.

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

MLA Handbook (7th Edition):

Burnett, Linda Dee. “Heuristic Optimization of Boolean Functions and Substitution Boxes for Cryptography.” 2005. Web. 26 Oct 2020.

Vancouver:

Burnett LD. Heuristic Optimization of Boolean Functions and Substitution Boxes for Cryptography. [Internet] [Thesis]. Queensland University of Technology; 2005. [cited 2020 Oct 26]. Available from: https://eprints.qut.edu.au/16023/.

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

Council of Science Editors:

Burnett LD. Heuristic Optimization of Boolean Functions and Substitution Boxes for Cryptography. [Thesis]. Queensland University of Technology; 2005. Available from: https://eprints.qut.edu.au/16023/

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

14. Singh, Vinay. Design and Shape Optimization of Unmanned, Semi-Rigid Airship for Rapid Descent Using Hybrid Genetic Algorithm .

Degree: 2019, University of Ottawa

 Airships provide an eco-friendly and cost-effective means to suit sustained airborne operations. Smaller autonomous airships are highly susceptible to adverse atmospheric conditions owing to their… (more)

Subjects/Keywords: genetic algorithm; hill climbing; optimization; Pareto optimality; rapid descent; semi-rigid airship

…23 HC Hill climbing… …most common approach to achieve this is to use hill climbing (HC) technique after… …the mutation stage. Hill climbing is a common local search method that usually starts with a… …incremental changes to the solution. There are several implementations of hill climbing proposed in… …Pseudocode- Crossover hill climbing (p1 , p2 , n0 , ni ) 1. p01 = p1 and p02 = p2 2. For… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Singh, V. (2019). Design and Shape Optimization of Unmanned, Semi-Rigid Airship for Rapid Descent Using Hybrid Genetic Algorithm . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/38673

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

Singh, Vinay. “Design and Shape Optimization of Unmanned, Semi-Rigid Airship for Rapid Descent Using Hybrid Genetic Algorithm .” 2019. Thesis, University of Ottawa. Accessed October 26, 2020. http://hdl.handle.net/10393/38673.

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

MLA Handbook (7th Edition):

Singh, Vinay. “Design and Shape Optimization of Unmanned, Semi-Rigid Airship for Rapid Descent Using Hybrid Genetic Algorithm .” 2019. Web. 26 Oct 2020.

Vancouver:

Singh V. Design and Shape Optimization of Unmanned, Semi-Rigid Airship for Rapid Descent Using Hybrid Genetic Algorithm . [Internet] [Thesis]. University of Ottawa; 2019. [cited 2020 Oct 26]. Available from: http://hdl.handle.net/10393/38673.

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

Council of Science Editors:

Singh V. Design and Shape Optimization of Unmanned, Semi-Rigid Airship for Rapid Descent Using Hybrid Genetic Algorithm . [Thesis]. University of Ottawa; 2019. Available from: http://hdl.handle.net/10393/38673

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


University of Maryland

15. Choi, Seungryul. Hill-Climbing SMT Processor Resource Distribution.

Degree: Computer Science, 2006, University of Maryland

 The key to high performance in SMT processors lies in optimizing the shared resources distribution among simultaneously executing threads. Existing resource distribution techniques optimize performance… (more)

Subjects/Keywords: Computer Science; Engineering, Electronics and Electrical; Computer architecture; Micro processor design; Simultaneous multi-threading; Resource distribution; Hill-climbing algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Choi, S. (2006). Hill-Climbing SMT Processor Resource Distribution. (Thesis). University of Maryland. Retrieved from http://hdl.handle.net/1903/3514

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

Choi, Seungryul. “Hill-Climbing SMT Processor Resource Distribution.” 2006. Thesis, University of Maryland. Accessed October 26, 2020. http://hdl.handle.net/1903/3514.

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

MLA Handbook (7th Edition):

Choi, Seungryul. “Hill-Climbing SMT Processor Resource Distribution.” 2006. Web. 26 Oct 2020.

Vancouver:

Choi S. Hill-Climbing SMT Processor Resource Distribution. [Internet] [Thesis]. University of Maryland; 2006. [cited 2020 Oct 26]. Available from: http://hdl.handle.net/1903/3514.

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

Council of Science Editors:

Choi S. Hill-Climbing SMT Processor Resource Distribution. [Thesis]. University of Maryland; 2006. Available from: http://hdl.handle.net/1903/3514

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


University of Maryland

16. Fan, Xiao Zhu. Enhancement of an indium phosphide resonator sensor microsystem through the development of an adaptive feedback circuit and electrospray deposition.

Degree: Electrical Engineering, 2009, University of Maryland

 Cantilever resonator sensor enhancement through the development of an adaptive feedback circuit and the use of electrospray deposition is presented. The feedback system adapts to… (more)

Subjects/Keywords: Engineering, Electronics and Electrical; Adaptive Feedback Circuit; Electrospray Deposition; Hill Climbing Algorithm; Indium Phosphide Cantilever; Waveguide Resonator

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fan, X. Z. (2009). Enhancement of an indium phosphide resonator sensor microsystem through the development of an adaptive feedback circuit and electrospray deposition. (Thesis). University of Maryland. Retrieved from http://hdl.handle.net/1903/9679

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

Fan, Xiao Zhu. “Enhancement of an indium phosphide resonator sensor microsystem through the development of an adaptive feedback circuit and electrospray deposition.” 2009. Thesis, University of Maryland. Accessed October 26, 2020. http://hdl.handle.net/1903/9679.

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

MLA Handbook (7th Edition):

Fan, Xiao Zhu. “Enhancement of an indium phosphide resonator sensor microsystem through the development of an adaptive feedback circuit and electrospray deposition.” 2009. Web. 26 Oct 2020.

Vancouver:

Fan XZ. Enhancement of an indium phosphide resonator sensor microsystem through the development of an adaptive feedback circuit and electrospray deposition. [Internet] [Thesis]. University of Maryland; 2009. [cited 2020 Oct 26]. Available from: http://hdl.handle.net/1903/9679.

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

Council of Science Editors:

Fan XZ. Enhancement of an indium phosphide resonator sensor microsystem through the development of an adaptive feedback circuit and electrospray deposition. [Thesis]. University of Maryland; 2009. Available from: http://hdl.handle.net/1903/9679

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


Virginia Tech

17. Vaneman, Warren Kenneth. Evaluating System Performance in a Complex and Dynamic Environment.

Degree: PhD, Industrial and Systems Engineering, 2002, Virginia Tech

 Realistically, organizational and/or system efficiency performance is dynamic, non-linear, and a function of multiple interactions in production. However, in the efficiency literature, system performance is… (more)

Subjects/Keywords: system performance; system dynamics modeling; implementation phase; introduction of new technology; dynamic production axioms; dynamic productive efficiency; hill-climbing optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vaneman, W. K. (2002). Evaluating System Performance in a Complex and Dynamic Environment. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/30043

Chicago Manual of Style (16th Edition):

Vaneman, Warren Kenneth. “Evaluating System Performance in a Complex and Dynamic Environment.” 2002. Doctoral Dissertation, Virginia Tech. Accessed October 26, 2020. http://hdl.handle.net/10919/30043.

MLA Handbook (7th Edition):

Vaneman, Warren Kenneth. “Evaluating System Performance in a Complex and Dynamic Environment.” 2002. Web. 26 Oct 2020.

Vancouver:

Vaneman WK. Evaluating System Performance in a Complex and Dynamic Environment. [Internet] [Doctoral dissertation]. Virginia Tech; 2002. [cited 2020 Oct 26]. Available from: http://hdl.handle.net/10919/30043.

Council of Science Editors:

Vaneman WK. Evaluating System Performance in a Complex and Dynamic Environment. [Doctoral Dissertation]. Virginia Tech; 2002. Available from: http://hdl.handle.net/10919/30043


Virginia Tech

18. McInvale, Howard D. Land Leveling Using Optimal Earthmoving Vehicle Routing.

Degree: MS, Industrial and Systems Engineering, 2002, Virginia Tech

 This thesis presents new solution approaches for land leveling, using optimal earthmoving vehicle routing. It addresses the Shortest Route Cut and Fill Problem (SRCFP) developed… (more)

Subjects/Keywords: Discrete Optimization; Traveling Salesman Problem; Heuristics; Vehicle Routing Problems; Local Search Algorithms; Shortest Route Cut-Fill Problem; Generalized Hill Climbing Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

McInvale, H. D. (2002). Land Leveling Using Optimal Earthmoving Vehicle Routing. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/42356

Chicago Manual of Style (16th Edition):

McInvale, Howard D. “Land Leveling Using Optimal Earthmoving Vehicle Routing.” 2002. Masters Thesis, Virginia Tech. Accessed October 26, 2020. http://hdl.handle.net/10919/42356.

MLA Handbook (7th Edition):

McInvale, Howard D. “Land Leveling Using Optimal Earthmoving Vehicle Routing.” 2002. Web. 26 Oct 2020.

Vancouver:

McInvale HD. Land Leveling Using Optimal Earthmoving Vehicle Routing. [Internet] [Masters thesis]. Virginia Tech; 2002. [cited 2020 Oct 26]. Available from: http://hdl.handle.net/10919/42356.

Council of Science Editors:

McInvale HD. Land Leveling Using Optimal Earthmoving Vehicle Routing. [Masters Thesis]. Virginia Tech; 2002. Available from: http://hdl.handle.net/10919/42356


Virginia Tech

19. Vaughan, Diane Elizabeth. Simultaneous Generalized Hill Climbing Algorithms for Addressing Sets of Discrete Optimization Problems.

Degree: PhD, Industrial and Systems Engineering, 2000, Virginia Tech

 Generalized hill climbing (GHC) algorithms provide a framework for using local search algorithms to address intractable discrete optimization problems. Many well-known local search algorithms can… (more)

Subjects/Keywords: Traveling Salesman Problem; Ergodicity; Local Search; Markov Chains; Simulated Annealing; Generalized Hill Climbing Algorithms; Manufacturing Applications

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vaughan, D. E. (2000). Simultaneous Generalized Hill Climbing Algorithms for Addressing Sets of Discrete Optimization Problems. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/28514

Chicago Manual of Style (16th Edition):

Vaughan, Diane Elizabeth. “Simultaneous Generalized Hill Climbing Algorithms for Addressing Sets of Discrete Optimization Problems.” 2000. Doctoral Dissertation, Virginia Tech. Accessed October 26, 2020. http://hdl.handle.net/10919/28514.

MLA Handbook (7th Edition):

Vaughan, Diane Elizabeth. “Simultaneous Generalized Hill Climbing Algorithms for Addressing Sets of Discrete Optimization Problems.” 2000. Web. 26 Oct 2020.

Vancouver:

Vaughan DE. Simultaneous Generalized Hill Climbing Algorithms for Addressing Sets of Discrete Optimization Problems. [Internet] [Doctoral dissertation]. Virginia Tech; 2000. [cited 2020 Oct 26]. Available from: http://hdl.handle.net/10919/28514.

Council of Science Editors:

Vaughan DE. Simultaneous Generalized Hill Climbing Algorithms for Addressing Sets of Discrete Optimization Problems. [Doctoral Dissertation]. Virginia Tech; 2000. Available from: http://hdl.handle.net/10919/28514


Virginia Tech

20. Henderson, Darrall. Assessing the Finite-Time Performance of Local Search Algorithms.

Degree: PhD, Industrial and Systems Engineering, 2001, Virginia Tech

 Identifying a globally optimal solution for an intractable discrete optimization problem is often cost prohibitive. Therefore, solutions that are within a predetermined threshold are often… (more)

Subjects/Keywords: hill climbing algorithms; heuristics; finite-time performance; discrete optimization; combinatorial optimization; simulated annealing; convergence; local search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Henderson, D. (2001). Assessing the Finite-Time Performance of Local Search Algorithms. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/26926

Chicago Manual of Style (16th Edition):

Henderson, Darrall. “Assessing the Finite-Time Performance of Local Search Algorithms.” 2001. Doctoral Dissertation, Virginia Tech. Accessed October 26, 2020. http://hdl.handle.net/10919/26926.

MLA Handbook (7th Edition):

Henderson, Darrall. “Assessing the Finite-Time Performance of Local Search Algorithms.” 2001. Web. 26 Oct 2020.

Vancouver:

Henderson D. Assessing the Finite-Time Performance of Local Search Algorithms. [Internet] [Doctoral dissertation]. Virginia Tech; 2001. [cited 2020 Oct 26]. Available from: http://hdl.handle.net/10919/26926.

Council of Science Editors:

Henderson D. Assessing the Finite-Time Performance of Local Search Algorithms. [Doctoral Dissertation]. Virginia Tech; 2001. Available from: http://hdl.handle.net/10919/26926


Virginia Tech

21. Sullivan, Kelly Ann. A Convergence Analysis of Generalized Hill Climbing Algorithms.

Degree: PhD, Industrial and Systems Engineering, 1999, Virginia Tech

 Generalized hill climbing (GHC) algorithms provide a unifying framework for describing several discrete optimization problem local search heuristics, including simulated annealing and tabu search. A… (more)

Subjects/Keywords: heuristics; discrete optimization; local search; simulated annealing; convergence; combinatorial optimization; hill climbing algorithms; Markov chain

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sullivan, K. A. (1999). A Convergence Analysis of Generalized Hill Climbing Algorithms. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/27027

Chicago Manual of Style (16th Edition):

Sullivan, Kelly Ann. “A Convergence Analysis of Generalized Hill Climbing Algorithms.” 1999. Doctoral Dissertation, Virginia Tech. Accessed October 26, 2020. http://hdl.handle.net/10919/27027.

MLA Handbook (7th Edition):

Sullivan, Kelly Ann. “A Convergence Analysis of Generalized Hill Climbing Algorithms.” 1999. Web. 26 Oct 2020.

Vancouver:

Sullivan KA. A Convergence Analysis of Generalized Hill Climbing Algorithms. [Internet] [Doctoral dissertation]. Virginia Tech; 1999. [cited 2020 Oct 26]. Available from: http://hdl.handle.net/10919/27027.

Council of Science Editors:

Sullivan KA. A Convergence Analysis of Generalized Hill Climbing Algorithms. [Doctoral Dissertation]. Virginia Tech; 1999. Available from: http://hdl.handle.net/10919/27027


Virginia Tech

22. Johnson, Alan W. Generalized hill climbing algorithms for discrete optimization problems.

Degree: PhD, Industrial and Systems Engineering, 1996, Virginia Tech

 Generalized hill climbing (GHC) algorithms are introduced, as a tool to address difficult discrete optimization problems. Particular formulations of GHC algorithms include simulated annealing (SA),… (more)

Subjects/Keywords: simulated annealing; hill climbing algorithms; discrete optimization; combinatorial optimization; convergence; heuristics; LD5655.V856 1996.J646

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Johnson, A. W. (1996). Generalized hill climbing algorithms for discrete optimization problems. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/38064

Chicago Manual of Style (16th Edition):

Johnson, Alan W. “Generalized hill climbing algorithms for discrete optimization problems.” 1996. Doctoral Dissertation, Virginia Tech. Accessed October 26, 2020. http://hdl.handle.net/10919/38064.

MLA Handbook (7th Edition):

Johnson, Alan W. “Generalized hill climbing algorithms for discrete optimization problems.” 1996. Web. 26 Oct 2020.

Vancouver:

Johnson AW. Generalized hill climbing algorithms for discrete optimization problems. [Internet] [Doctoral dissertation]. Virginia Tech; 1996. [cited 2020 Oct 26]. Available from: http://hdl.handle.net/10919/38064.

Council of Science Editors:

Johnson AW. Generalized hill climbing algorithms for discrete optimization problems. [Doctoral Dissertation]. Virginia Tech; 1996. Available from: http://hdl.handle.net/10919/38064


Brno University of Technology

23. Kopřiva, Jan. Srovnání algoritmů při řešení problému obchodního cestujícího: The Comparison of the Algorithms for the Solution of Travel Sales Problem.

Degree: 2019, Brno University of Technology

 The Master Thesis deals with logistic module innovation of information system ERP. The principle of innovation is based on implementation of heuristic algorithms which solve… (more)

Subjects/Keywords: Problém obchodního cestujícího; Turingův stroj; časová a prostorová složitost problému; polynomialní složitost; deterministický a nedeterministický algoritmus; orientovaný a neorientovaný graf; software MATLAB; P-těžké problémy; N-těžké problémy; NP-úplné problémy; algoritmus Hill climbing; algoritmus Tabu search; alogritmus Exhause search; algoritmus Random search; algoritmus Greedy; algoritmus Backtracking; algoritmus Simultal anheling; algoritmus Genetic search; algoritmus Ant Colony; algoritmus Particle swarms; Travel salesman problem; Turing machine; time and space complexity; polynomial time; deterministic and nondeterministic algorithm; directed and undirected graph; software MATLAB; P-hard; N-hard; NP-complete problem; alogrithm Hill climbing; algorithm Tabu search; algorithm Exhause search; algorithm Random search; algoritm Greedy; algorithm Backtracking; algorithm Simultal anheling; Genetic algorithm; algorithm Ant Colony algorithm; algoritm Particle swarms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kopřiva, J. (2019). Srovnání algoritmů při řešení problému obchodního cestujícího: The Comparison of the Algorithms for the Solution of Travel Sales Problem. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/4355

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

Kopřiva, Jan. “Srovnání algoritmů při řešení problému obchodního cestujícího: The Comparison of the Algorithms for the Solution of Travel Sales Problem.” 2019. Thesis, Brno University of Technology. Accessed October 26, 2020. http://hdl.handle.net/11012/4355.

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

MLA Handbook (7th Edition):

Kopřiva, Jan. “Srovnání algoritmů při řešení problému obchodního cestujícího: The Comparison of the Algorithms for the Solution of Travel Sales Problem.” 2019. Web. 26 Oct 2020.

Vancouver:

Kopřiva J. Srovnání algoritmů při řešení problému obchodního cestujícího: The Comparison of the Algorithms for the Solution of Travel Sales Problem. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Oct 26]. Available from: http://hdl.handle.net/11012/4355.

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

Council of Science Editors:

Kopřiva J. Srovnání algoritmů při řešení problému obchodního cestujícího: The Comparison of the Algorithms for the Solution of Travel Sales Problem. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/4355

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


Brno University of Technology

24. Jurčík, Lukáš. Evoluční algoritmy při řešení problému obchodního cestujícího: Evolutionary Algorithms for the Solution of Travelling Salesman Problem.

Degree: 2014, Brno University of Technology

 This diploma thesis deals with evolutionary algorithms used for travelling salesman problem (TSP). In the first section, there are theoretical foundations of a graph theory… (more)

Subjects/Keywords: Problém obchodního cestujícího; evoluční algoritmy; Matlab; Hamiltonovská kružnice; optimalizace mravenčí kolonií; kukaččí algoritmus; Random Search; Exhaustive Search; hladové vyhledávání; horolezecký algoritmus; teorie složitosti; NP-úplné problémy.; Travelling Salesman Problem; evolutionary algorithms; Matlab; Hamiltonian Cycle; Ant Colony Optimization; Cuckoo Search; Random Search; Exhaustive Search; Greedy Search; Hill Climbing; Computational complexity theory; NP-complete problems.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jurčík, L. (2014). Evoluční algoritmy při řešení problému obchodního cestujícího: Evolutionary Algorithms for the Solution of Travelling Salesman Problem. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/31411

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

Jurčík, Lukáš. “Evoluční algoritmy při řešení problému obchodního cestujícího: Evolutionary Algorithms for the Solution of Travelling Salesman Problem.” 2014. Thesis, Brno University of Technology. Accessed October 26, 2020. http://hdl.handle.net/11012/31411.

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

MLA Handbook (7th Edition):

Jurčík, Lukáš. “Evoluční algoritmy při řešení problému obchodního cestujícího: Evolutionary Algorithms for the Solution of Travelling Salesman Problem.” 2014. Web. 26 Oct 2020.

Vancouver:

Jurčík L. Evoluční algoritmy při řešení problému obchodního cestujícího: Evolutionary Algorithms for the Solution of Travelling Salesman Problem. [Internet] [Thesis]. Brno University of Technology; 2014. [cited 2020 Oct 26]. Available from: http://hdl.handle.net/11012/31411.

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

Council of Science Editors:

Jurčík L. Evoluční algoritmy při řešení problému obchodního cestujícího: Evolutionary Algorithms for the Solution of Travelling Salesman Problem. [Thesis]. Brno University of Technology; 2014. Available from: http://hdl.handle.net/11012/31411

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


University of Stirling

25. Graham, Kevin. An Investigation of Factors Influencing Algorithm Selection for High Dimensional Continuous Optimisation Problems.

Degree: PhD, 2019, University of Stirling

 The problem of algorithm selection is of great importance to the optimisation community, with a number of publications present in the Body-of-Knowledge. This importance stems… (more)

Subjects/Keywords: large-scale optimisation; metaheuristics; algorithm selection; automatic parameter tuning; parameter tuning; algorithm configuration; continuous optimisation; optimisation; optimization; optimisation benchmark; genetic algorithm; particle swarm optimisation; differential evolution; covarience matrix adaptation evolutionary strategy; simulated annealing; hill climbing; search-based optimisation; metaheuristic search; metaheuristic scalability; Metaheuristics; Algorithm; Optimisation; Simulated annealing (Mathematics)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Graham, K. (2019). An Investigation of Factors Influencing Algorithm Selection for High Dimensional Continuous Optimisation Problems. (Doctoral Dissertation). University of Stirling. Retrieved from http://hdl.handle.net/1893/30670

Chicago Manual of Style (16th Edition):

Graham, Kevin. “An Investigation of Factors Influencing Algorithm Selection for High Dimensional Continuous Optimisation Problems.” 2019. Doctoral Dissertation, University of Stirling. Accessed October 26, 2020. http://hdl.handle.net/1893/30670.

MLA Handbook (7th Edition):

Graham, Kevin. “An Investigation of Factors Influencing Algorithm Selection for High Dimensional Continuous Optimisation Problems.” 2019. Web. 26 Oct 2020.

Vancouver:

Graham K. An Investigation of Factors Influencing Algorithm Selection for High Dimensional Continuous Optimisation Problems. [Internet] [Doctoral dissertation]. University of Stirling; 2019. [cited 2020 Oct 26]. Available from: http://hdl.handle.net/1893/30670.

Council of Science Editors:

Graham K. An Investigation of Factors Influencing Algorithm Selection for High Dimensional Continuous Optimisation Problems. [Doctoral Dissertation]. University of Stirling; 2019. Available from: http://hdl.handle.net/1893/30670


Queensland University of Technology

26. Millan, William L. Analysis and design of Boolean functions for cryptographic applications.

Degree: 1997, Queensland University of Technology

Subjects/Keywords: Boolean functions; Cryptography; Boolean functions; cryptology; Walsh-Hadamard transform; algebraic normal form; autocorrelation; cryptographic criteria; sphere sampling; genetic algorithm; hill climbing; S-box; self-synchronous cipher; cryptanalysis; thesis; doctoral

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Millan, W. L. (1997). Analysis and design of Boolean functions for cryptographic applications. (Thesis). Queensland University of Technology. Retrieved from http://eprints.qut.edu.au/36829/

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

Millan, William L. “Analysis and design of Boolean functions for cryptographic applications.” 1997. Thesis, Queensland University of Technology. Accessed October 26, 2020. http://eprints.qut.edu.au/36829/.

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

MLA Handbook (7th Edition):

Millan, William L. “Analysis and design of Boolean functions for cryptographic applications.” 1997. Web. 26 Oct 2020.

Vancouver:

Millan WL. Analysis and design of Boolean functions for cryptographic applications. [Internet] [Thesis]. Queensland University of Technology; 1997. [cited 2020 Oct 26]. Available from: http://eprints.qut.edu.au/36829/.

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

Council of Science Editors:

Millan WL. Analysis and design of Boolean functions for cryptographic applications. [Thesis]. Queensland University of Technology; 1997. Available from: http://eprints.qut.edu.au/36829/

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


Queensland University of Technology

27. Chalup, Stephan Konrad. Incremental learning with neural networks, evolutionary computation and reinforcement learning algorithms.

Degree: 2001, Queensland University of Technology

Subjects/Keywords: Neural networks (Computer science); Algorithms; Machine learning; machine learning; recurrent neural networks; evolutionary hill climbing; temporal difference learning; incremental learning; context-sensitive language; game of Hex; thesis; doctoral

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chalup, S. K. (2001). Incremental learning with neural networks, evolutionary computation and reinforcement learning algorithms. (Thesis). Queensland University of Technology. Retrieved from http://eprints.qut.edu.au/36866/

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

Chalup, Stephan Konrad. “Incremental learning with neural networks, evolutionary computation and reinforcement learning algorithms.” 2001. Thesis, Queensland University of Technology. Accessed October 26, 2020. http://eprints.qut.edu.au/36866/.

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

MLA Handbook (7th Edition):

Chalup, Stephan Konrad. “Incremental learning with neural networks, evolutionary computation and reinforcement learning algorithms.” 2001. Web. 26 Oct 2020.

Vancouver:

Chalup SK. Incremental learning with neural networks, evolutionary computation and reinforcement learning algorithms. [Internet] [Thesis]. Queensland University of Technology; 2001. [cited 2020 Oct 26]. Available from: http://eprints.qut.edu.au/36866/.

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

Council of Science Editors:

Chalup SK. Incremental learning with neural networks, evolutionary computation and reinforcement learning algorithms. [Thesis]. Queensland University of Technology; 2001. Available from: http://eprints.qut.edu.au/36866/

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


University of South Florida

28. Mohanty, Pranab. Learning from biometric distances: Performance and security related issues in face recognition systems.

Degree: 2007, University of South Florida

 We present a theory for constructing linear, black box approximations to face recognition algorithms and empirically demonstrate that a surprisingly diverse set of face recognition… (more)

Subjects/Keywords: Security and privacy issues in biometrics; Modeling face recognition algorithms; Face template reconstruction; Multi-dimensional scaling; Distance based embedding; Hill climbing approach; Hacking face recognition systems; Face template indexing; American Studies; Arts and Humanities

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mohanty, P. (2007). Learning from biometric distances: Performance and security related issues in face recognition systems. (Thesis). University of South Florida. Retrieved from https://scholarcommons.usf.edu/etd/2293

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

Mohanty, Pranab. “Learning from biometric distances: Performance and security related issues in face recognition systems.” 2007. Thesis, University of South Florida. Accessed October 26, 2020. https://scholarcommons.usf.edu/etd/2293.

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

MLA Handbook (7th Edition):

Mohanty, Pranab. “Learning from biometric distances: Performance and security related issues in face recognition systems.” 2007. Web. 26 Oct 2020.

Vancouver:

Mohanty P. Learning from biometric distances: Performance and security related issues in face recognition systems. [Internet] [Thesis]. University of South Florida; 2007. [cited 2020 Oct 26]. Available from: https://scholarcommons.usf.edu/etd/2293.

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

Council of Science Editors:

Mohanty P. Learning from biometric distances: Performance and security related issues in face recognition systems. [Thesis]. University of South Florida; 2007. Available from: https://scholarcommons.usf.edu/etd/2293

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

29. Boonvisut, Pasu. Active Exploration of Deformable Object Boundary Constraints and Material Parameters Through Robotic Manipulation Data.

Degree: PhD, EECS - System and Control Engineering, 2013, Case Western Reserve University School of Graduate Studies

 Robotic motion planning algorithms for manipulation of deformable objects, such as in medical robotics applications, rely on accurate estimations of object deformations that occur during… (more)

Subjects/Keywords: Robots; Robotics; Surgery; Materials Science; Boundary Constraints; Parameter Estimation; Deformable Object; FEM; Hill-Climbing; Active Exploration; Medical Surgical Simulation; Robotic Manipulation

…38 3.2 Two-Stage hill climbing algorithm block diagram . . . . . . . . . . . . . 41 3.3… …Multi-Stage Refining Hill Climbing Algorithm . . . . . . . . . . . . . . 41 3.4 Patches and… …employs a multi-stage hill climbing procedure. An active exploration technique, which uses an… …deformation data collected with a stereo vision system, and employs a multi-stage hill climbing… …employs Multi-Stage Hill-Climbing method with a finite element model mesh refinement to ensure… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Boonvisut, P. (2013). Active Exploration of Deformable Object Boundary Constraints and Material Parameters Through Robotic Manipulation Data. (Doctoral Dissertation). Case Western Reserve University School of Graduate Studies. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=case1369078402

Chicago Manual of Style (16th Edition):

Boonvisut, Pasu. “Active Exploration of Deformable Object Boundary Constraints and Material Parameters Through Robotic Manipulation Data.” 2013. Doctoral Dissertation, Case Western Reserve University School of Graduate Studies. Accessed October 26, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=case1369078402.

MLA Handbook (7th Edition):

Boonvisut, Pasu. “Active Exploration of Deformable Object Boundary Constraints and Material Parameters Through Robotic Manipulation Data.” 2013. Web. 26 Oct 2020.

Vancouver:

Boonvisut P. Active Exploration of Deformable Object Boundary Constraints and Material Parameters Through Robotic Manipulation Data. [Internet] [Doctoral dissertation]. Case Western Reserve University School of Graduate Studies; 2013. [cited 2020 Oct 26]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=case1369078402.

Council of Science Editors:

Boonvisut P. Active Exploration of Deformable Object Boundary Constraints and Material Parameters Through Robotic Manipulation Data. [Doctoral Dissertation]. Case Western Reserve University School of Graduate Studies; 2013. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=case1369078402


Brno University of Technology

30. Trupl, Jan. Paralelní genetický algoritmus: Parallel genetic algorithm.

Degree: 2020, Brno University of Technology

 The thesis describes design and implementation of various evolutionary algorithms, which were enhanced to use the advantages of parallelism on the multiprocessor systems along with… (more)

Subjects/Keywords: genetický algoritmus; evoluční algoritmus; Message Passing Interface; MPI; OpenMP; globální extrém; minimum; maximum; cenová funkce; fitness funkce; paralelizace; paralelní; neuronová sít; inverzní fraktální problém; koeficienty fourierovy řady; standardní genetický algoritmus; SGA; diferenciální evoluce; DE; samoorganizační migrační algoritmus; SOMA; stochastický horolezecký algoritmus; SHA; evolutionary algorithm; genetic algorithm; Message Passing Interface; MPI; OpenMP; global extreme; minimum; maximum; cost function; fitness function; parallelisation; parallel; neural network; inverse fractal problem; coeficients; fourier; queue; standard genetic algorithm; SGA; differential evolution; DE; self-organizing migrating algorithm; SOMA; stochastic hill climbing; SHC

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Trupl, J. (2020). Paralelní genetický algoritmus: Parallel genetic algorithm. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/187391

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

Trupl, Jan. “Paralelní genetický algoritmus: Parallel genetic algorithm.” 2020. Thesis, Brno University of Technology. Accessed October 26, 2020. http://hdl.handle.net/11012/187391.

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

MLA Handbook (7th Edition):

Trupl, Jan. “Paralelní genetický algoritmus: Parallel genetic algorithm.” 2020. Web. 26 Oct 2020.

Vancouver:

Trupl J. Paralelní genetický algoritmus: Parallel genetic algorithm. [Internet] [Thesis]. Brno University of Technology; 2020. [cited 2020 Oct 26]. Available from: http://hdl.handle.net/11012/187391.

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

Council of Science Editors:

Trupl J. Paralelní genetický algoritmus: Parallel genetic algorithm. [Thesis]. Brno University of Technology; 2020. Available from: http://hdl.handle.net/11012/187391

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

[1] [2]

.