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:(Random Search). Showing records 1 – 30 of 64 total matches.

[1] [2] [3]

Search Limiters

Last 2 Years | English Only

▼ Search Limiters


Penn State University

1. Huang, Pidong. Essays in Monetary and Banking Theory.

Degree: PhD, Economics, 2012, Penn State University

 Abstract Chapter 1, Lotteries are introduced into Cavalcanti-Erosa (2008), a version of Trejos-Wright (1995) with aggregate shocks. Lotteries improve welfare and eliminate the two notable… (more)

Subjects/Keywords: Random search model of money; Bank run

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Huang, P. (2012). Essays in Monetary and Banking Theory. (Doctoral Dissertation). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/13707

Chicago Manual of Style (16th Edition):

Huang, Pidong. “Essays in Monetary and Banking Theory.” 2012. Doctoral Dissertation, Penn State University. Accessed July 14, 2020. https://etda.libraries.psu.edu/catalog/13707.

MLA Handbook (7th Edition):

Huang, Pidong. “Essays in Monetary and Banking Theory.” 2012. Web. 14 Jul 2020.

Vancouver:

Huang P. Essays in Monetary and Banking Theory. [Internet] [Doctoral dissertation]. Penn State University; 2012. [cited 2020 Jul 14]. Available from: https://etda.libraries.psu.edu/catalog/13707.

Council of Science Editors:

Huang P. Essays in Monetary and Banking Theory. [Doctoral Dissertation]. Penn State University; 2012. Available from: https://etda.libraries.psu.edu/catalog/13707


University of Illinois – Urbana-Champaign

2. Wang, Lingyong. People and reverse people search on the internet.

Degree: MS, 0112, 2014, University of Illinois – Urbana-Champaign

 Company has needs to maintain their contact information database up to date and manually update contact record is error prone and time consuming. We created… (more)

Subjects/Keywords: people search; reverse people search; personalized PageRank; random walk

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, L. (2014). People and reverse people search on the internet. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/49511

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

Wang, Lingyong. “People and reverse people search on the internet.” 2014. Thesis, University of Illinois – Urbana-Champaign. Accessed July 14, 2020. http://hdl.handle.net/2142/49511.

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

MLA Handbook (7th Edition):

Wang, Lingyong. “People and reverse people search on the internet.” 2014. Web. 14 Jul 2020.

Vancouver:

Wang L. People and reverse people search on the internet. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2014. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/2142/49511.

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

Council of Science Editors:

Wang L. People and reverse people search on the internet. [Thesis]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/49511

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


University of Alberta

3. Nakhost, Hootan. Random Walk Planning: Theory, Practice, and Application.

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

 This thesis introduces random walk (RW) planning as a new search paradigm for satisficing planning by studying its theory, its practical relevance, and applications. We… (more)

Subjects/Keywords: Resource-constrained Planning; AI planning; Random Walk Theory; Random Walk Planning; Heuristic Search; Plan Improvement

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nakhost, H. (2013). Random Walk Planning: Theory, Practice, and Application. (Doctoral Dissertation). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/jq085m672

Chicago Manual of Style (16th Edition):

Nakhost, Hootan. “Random Walk Planning: Theory, Practice, and Application.” 2013. Doctoral Dissertation, University of Alberta. Accessed July 14, 2020. https://era.library.ualberta.ca/files/jq085m672.

MLA Handbook (7th Edition):

Nakhost, Hootan. “Random Walk Planning: Theory, Practice, and Application.” 2013. Web. 14 Jul 2020.

Vancouver:

Nakhost H. Random Walk Planning: Theory, Practice, and Application. [Internet] [Doctoral dissertation]. University of Alberta; 2013. [cited 2020 Jul 14]. Available from: https://era.library.ualberta.ca/files/jq085m672.

Council of Science Editors:

Nakhost H. Random Walk Planning: Theory, Practice, and Application. [Doctoral Dissertation]. University of Alberta; 2013. Available from: https://era.library.ualberta.ca/files/jq085m672


University of Utah

4. Newby, Jay. Molecular motor-based models of random intermittent search in dendrites.

Degree: PhD, Mathematics;, 2010, University of Utah

 A key component in the cellular mechanisms underlying learning and memory involves the distribution and delivery of mRNA to synaptic sites in dendrites. A minimal… (more)

Subjects/Keywords: Dendrites; Intracellular transport; Jump velocity; Molecular motors; MRNA transport; Random search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Newby, J. (2010). Molecular motor-based models of random intermittent search in dendrites. (Doctoral Dissertation). University of Utah. Retrieved from http://content.lib.utah.edu/cdm/singleitem/collection/etd2/id/606/rec/787

Chicago Manual of Style (16th Edition):

Newby, Jay. “Molecular motor-based models of random intermittent search in dendrites.” 2010. Doctoral Dissertation, University of Utah. Accessed July 14, 2020. http://content.lib.utah.edu/cdm/singleitem/collection/etd2/id/606/rec/787.

MLA Handbook (7th Edition):

Newby, Jay. “Molecular motor-based models of random intermittent search in dendrites.” 2010. Web. 14 Jul 2020.

Vancouver:

Newby J. Molecular motor-based models of random intermittent search in dendrites. [Internet] [Doctoral dissertation]. University of Utah; 2010. [cited 2020 Jul 14]. Available from: http://content.lib.utah.edu/cdm/singleitem/collection/etd2/id/606/rec/787.

Council of Science Editors:

Newby J. Molecular motor-based models of random intermittent search in dendrites. [Doctoral Dissertation]. University of Utah; 2010. Available from: http://content.lib.utah.edu/cdm/singleitem/collection/etd2/id/606/rec/787


Georgia Tech

5. Hu, Liujia. Convergent algorithms in simulation optimization.

Degree: PhD, Industrial and Systems Engineering, 2015, Georgia Tech

 It is frequently the case that deterministic optimization models could be made more practical by explicitly incorporating uncertainty. The resulting stochastic optimization problems are in… (more)

Subjects/Keywords: Simulation optimization; Adaptive random search; Global convergence; Stochastic constraints

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hu, L. (2015). Convergent algorithms in simulation optimization. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/54883

Chicago Manual of Style (16th Edition):

Hu, Liujia. “Convergent algorithms in simulation optimization.” 2015. Doctoral Dissertation, Georgia Tech. Accessed July 14, 2020. http://hdl.handle.net/1853/54883.

MLA Handbook (7th Edition):

Hu, Liujia. “Convergent algorithms in simulation optimization.” 2015. Web. 14 Jul 2020.

Vancouver:

Hu L. Convergent algorithms in simulation optimization. [Internet] [Doctoral dissertation]. Georgia Tech; 2015. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/1853/54883.

Council of Science Editors:

Hu L. Convergent algorithms in simulation optimization. [Doctoral Dissertation]. Georgia Tech; 2015. Available from: http://hdl.handle.net/1853/54883

6. Sinha, Sajib Kumer. Estimating Deep Web Properties by Random Walk.

Degree: MS, Computer Science, 2013, National Library of Canada

  The deep web is the part of World Wide Web that is hidden under form-like interfaces and can be accessed by queries only. Global… (more)

Subjects/Keywords: Communication and the arts; Applied sciences; Deep web; Estimation; Random walk; Sampling; Search engine

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sinha, S. K. (2013). Estimating Deep Web Properties by Random Walk. (Masters Thesis). National Library of Canada. Retrieved from http://scholar.uwindsor.ca/etd/4868

Chicago Manual of Style (16th Edition):

Sinha, Sajib Kumer. “Estimating Deep Web Properties by Random Walk.” 2013. Masters Thesis, National Library of Canada. Accessed July 14, 2020. http://scholar.uwindsor.ca/etd/4868.

MLA Handbook (7th Edition):

Sinha, Sajib Kumer. “Estimating Deep Web Properties by Random Walk.” 2013. Web. 14 Jul 2020.

Vancouver:

Sinha SK. Estimating Deep Web Properties by Random Walk. [Internet] [Masters thesis]. National Library of Canada; 2013. [cited 2020 Jul 14]. Available from: http://scholar.uwindsor.ca/etd/4868.

Council of Science Editors:

Sinha SK. Estimating Deep Web Properties by Random Walk. [Masters Thesis]. National Library of Canada; 2013. Available from: http://scholar.uwindsor.ca/etd/4868


Penn State University

7. Liao, Mouhua. Models of Strategic and Pairwise Trade.

Degree: PhD, Economics, 2012, Penn State University

 This dissertation consists of three chapters. In Chapter 1, a new type of market game is formulated: the strategy space generalizes the usual Cournot quantities… (more)

Subjects/Keywords: Market game; Limit orders; Nash equilibrium; Walras equilibrium; OTC market; Periodic market; Random search; Middlemen

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liao, M. (2012). Models of Strategic and Pairwise Trade. (Doctoral Dissertation). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/15119

Chicago Manual of Style (16th Edition):

Liao, Mouhua. “Models of Strategic and Pairwise Trade.” 2012. Doctoral Dissertation, Penn State University. Accessed July 14, 2020. https://etda.libraries.psu.edu/catalog/15119.

MLA Handbook (7th Edition):

Liao, Mouhua. “Models of Strategic and Pairwise Trade.” 2012. Web. 14 Jul 2020.

Vancouver:

Liao M. Models of Strategic and Pairwise Trade. [Internet] [Doctoral dissertation]. Penn State University; 2012. [cited 2020 Jul 14]. Available from: https://etda.libraries.psu.edu/catalog/15119.

Council of Science Editors:

Liao M. Models of Strategic and Pairwise Trade. [Doctoral Dissertation]. Penn State University; 2012. Available from: https://etda.libraries.psu.edu/catalog/15119


Temple University

8. Ratner, Michael. Quantum Walks and Structured Searches on Free Groups and Networks.

Degree: PhD, 2017, Temple University

Mathematics

Quantum walks have been utilized by many quantum algorithms which provide improved performance over their classical counterparts. Quantum search algorithms, the quantum analogues of… (more)

Subjects/Keywords: Mathematics; Computer science; Quantum physics;

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ratner, M. (2017). Quantum Walks and Structured Searches on Free Groups and Networks. (Doctoral Dissertation). Temple University. Retrieved from http://digital.library.temple.edu/u?/p245801coll10,442825

Chicago Manual of Style (16th Edition):

Ratner, Michael. “Quantum Walks and Structured Searches on Free Groups and Networks.” 2017. Doctoral Dissertation, Temple University. Accessed July 14, 2020. http://digital.library.temple.edu/u?/p245801coll10,442825.

MLA Handbook (7th Edition):

Ratner, Michael. “Quantum Walks and Structured Searches on Free Groups and Networks.” 2017. Web. 14 Jul 2020.

Vancouver:

Ratner M. Quantum Walks and Structured Searches on Free Groups and Networks. [Internet] [Doctoral dissertation]. Temple University; 2017. [cited 2020 Jul 14]. Available from: http://digital.library.temple.edu/u?/p245801coll10,442825.

Council of Science Editors:

Ratner M. Quantum Walks and Structured Searches on Free Groups and Networks. [Doctoral Dissertation]. Temple University; 2017. Available from: http://digital.library.temple.edu/u?/p245801coll10,442825

9. Zhao, Mao. Large Scale Image Retrieval From Books.

Degree: MS, Electrical & Computer Engineering, 2012, University of Massachusetts

Search engines play a very important role in daily life. As multimedia product becomes more and more popular, people have developed search engines for… (more)

Subjects/Keywords: search engine; image retrieval; random walk; book indexing; large scale; cloud computing; Other Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhao, M. (2012). Large Scale Image Retrieval From Books. (Masters Thesis). University of Massachusetts. Retrieved from https://scholarworks.umass.edu/theses/969

Chicago Manual of Style (16th Edition):

Zhao, Mao. “Large Scale Image Retrieval From Books.” 2012. Masters Thesis, University of Massachusetts. Accessed July 14, 2020. https://scholarworks.umass.edu/theses/969.

MLA Handbook (7th Edition):

Zhao, Mao. “Large Scale Image Retrieval From Books.” 2012. Web. 14 Jul 2020.

Vancouver:

Zhao M. Large Scale Image Retrieval From Books. [Internet] [Masters thesis]. University of Massachusetts; 2012. [cited 2020 Jul 14]. Available from: https://scholarworks.umass.edu/theses/969.

Council of Science Editors:

Zhao M. Large Scale Image Retrieval From Books. [Masters Thesis]. University of Massachusetts; 2012. Available from: https://scholarworks.umass.edu/theses/969


Brno University of Technology

10. 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 July 14, 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. 14 Jul 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 Jul 14]. 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 Melbourne

11. McKinlay, Shaun Antony. From sojourn times and boundary crossings to iterated random functions.

Degree: 2015, University of Melbourne

 This thesis was motivated by related sojourn time and boundary crossing problems for the Brownian motion process. In Chapter 1, we discuss these motivating problems,… (more)

Subjects/Keywords: random field; exchangeability; sojourn time; iterated random functions; nested interval schemes; Markov chains; interval splitting; random equations; beta distribution; limit distributions; stationary distributions; Markov chains; ergodicity; beta distribution; give-and-take model; semidegenerate kernel; random search; products of random matrices; Dirichlet distribution; random exchange models; random nested simplices; multivariate Brownian motion; boundary crossing probability; first hitting time density

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

McKinlay, S. A. (2015). From sojourn times and boundary crossings to iterated random functions. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/92277

Chicago Manual of Style (16th Edition):

McKinlay, Shaun Antony. “From sojourn times and boundary crossings to iterated random functions.” 2015. Doctoral Dissertation, University of Melbourne. Accessed July 14, 2020. http://hdl.handle.net/11343/92277.

MLA Handbook (7th Edition):

McKinlay, Shaun Antony. “From sojourn times and boundary crossings to iterated random functions.” 2015. Web. 14 Jul 2020.

Vancouver:

McKinlay SA. From sojourn times and boundary crossings to iterated random functions. [Internet] [Doctoral dissertation]. University of Melbourne; 2015. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/11343/92277.

Council of Science Editors:

McKinlay SA. From sojourn times and boundary crossings to iterated random functions. [Doctoral Dissertation]. University of Melbourne; 2015. Available from: http://hdl.handle.net/11343/92277

12. Fafalios, Pavlos. Exploiting linked data in exploratory search.

Degree: 2016, University of Crete (UOC); Πανεπιστήμιο Κρήτης

 In recent years we have witnessed an explosion in publishing data on the Web, mostly in the form of Linked Data. An important question is… (more)

Subjects/Keywords: Εξερευνητική αναζήτηση; Διασυνδεδεμένα δεδομένα; Εξόρυξη οντοτήτων; Τυχαίος περιηγητής; Σημασιολογική αναζήτηση; Exploratory search; Linked Open Data; Named-entity extraction; Random walk; Semantic search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fafalios, P. (2016). Exploiting linked data in exploratory search. (Thesis). University of Crete (UOC); Πανεπιστήμιο Κρήτης. Retrieved from http://hdl.handle.net/10442/hedi/38725

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

Fafalios, Pavlos. “Exploiting linked data in exploratory search.” 2016. Thesis, University of Crete (UOC); Πανεπιστήμιο Κρήτης. Accessed July 14, 2020. http://hdl.handle.net/10442/hedi/38725.

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

MLA Handbook (7th Edition):

Fafalios, Pavlos. “Exploiting linked data in exploratory search.” 2016. Web. 14 Jul 2020.

Vancouver:

Fafalios P. Exploiting linked data in exploratory search. [Internet] [Thesis]. University of Crete (UOC); Πανεπιστήμιο Κρήτης; 2016. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10442/hedi/38725.

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

Council of Science Editors:

Fafalios P. Exploiting linked data in exploratory search. [Thesis]. University of Crete (UOC); Πανεπιστήμιο Κρήτης; 2016. Available from: http://hdl.handle.net/10442/hedi/38725

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

13. ZARTA BARRERA, ANDRES FELIPE. Bassline Composition for Alternative Rock using SP and SDS algorithms, a multi-objective approach .

Degree: 2016, Universidad de los Andes

 Esta investigación tiene como propósito solucionar el problema de encontrar un “buen” bajo para acompañar una melodía y una batería, siguiendo la estructura del genero… (more)

Subjects/Keywords: Stochastic Diffusion Search; Dijkstra Algorithm; Random Search; Matching Algorithm; Musical Composition

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

ZARTA BARRERA, A. F. (2016). Bassline Composition for Alternative Rock using SP and SDS algorithms, a multi-objective approach . (Thesis). Universidad de los Andes. Retrieved from https://documentodegrado.uniandes.edu.co/documentos/9347.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):

ZARTA BARRERA, ANDRES FELIPE. “Bassline Composition for Alternative Rock using SP and SDS algorithms, a multi-objective approach .” 2016. Thesis, Universidad de los Andes. Accessed July 14, 2020. https://documentodegrado.uniandes.edu.co/documentos/9347.pdf.

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

MLA Handbook (7th Edition):

ZARTA BARRERA, ANDRES FELIPE. “Bassline Composition for Alternative Rock using SP and SDS algorithms, a multi-objective approach .” 2016. Web. 14 Jul 2020.

Vancouver:

ZARTA BARRERA AF. Bassline Composition for Alternative Rock using SP and SDS algorithms, a multi-objective approach . [Internet] [Thesis]. Universidad de los Andes; 2016. [cited 2020 Jul 14]. Available from: https://documentodegrado.uniandes.edu.co/documentos/9347.pdf.

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

Council of Science Editors:

ZARTA BARRERA AF. Bassline Composition for Alternative Rock using SP and SDS algorithms, a multi-objective approach . [Thesis]. Universidad de los Andes; 2016. Available from: https://documentodegrado.uniandes.edu.co/documentos/9347.pdf

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


University of South Africa

14. Gninkeu Tchapda, Ghislain Yanick. Application of improved particle swarm optimization in economic dispatch of power systems.

Degree: 2018, University of South Africa

 Economic dispatch is an important optimization challenge in power systems. It helps to find the optimal output power of a number of generating units that… (more)

Subjects/Keywords: Particle swarm optimization; Economic dispatch; Swarm intelligence; Genetic algorithm; Evolutionary algorithm; Bat algorithm; Cuckoo search algorithm; Power systems; Levy flight; Random search; Thermal power plant

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gninkeu Tchapda, G. Y. (2018). Application of improved particle swarm optimization in economic dispatch of power systems. (Masters Thesis). University of South Africa. Retrieved from http://hdl.handle.net/10500/24428

Chicago Manual of Style (16th Edition):

Gninkeu Tchapda, Ghislain Yanick. “Application of improved particle swarm optimization in economic dispatch of power systems.” 2018. Masters Thesis, University of South Africa. Accessed July 14, 2020. http://hdl.handle.net/10500/24428.

MLA Handbook (7th Edition):

Gninkeu Tchapda, Ghislain Yanick. “Application of improved particle swarm optimization in economic dispatch of power systems.” 2018. Web. 14 Jul 2020.

Vancouver:

Gninkeu Tchapda GY. Application of improved particle swarm optimization in economic dispatch of power systems. [Internet] [Masters thesis]. University of South Africa; 2018. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10500/24428.

Council of Science Editors:

Gninkeu Tchapda GY. Application of improved particle swarm optimization in economic dispatch of power systems. [Masters Thesis]. University of South Africa; 2018. Available from: http://hdl.handle.net/10500/24428


Indian Institute of Science

15. Rahaman, Md Aminoor. Search On A Hypercubic Lattice Using Quantum Random Walk.

Degree: 2009, Indian Institute of Science

Random walks describe diffusion processes, where movement at every time step is restricted only to neighbouring locations. Classical random walks are constructed using the non-relativistic… (more)

Subjects/Keywords: Lattice Theory - Data Processing; Quantum Random Walk; Grover's Algorithm; Dirac Operators; Quantum Computation; Dimensional Hypercubic Lattices; Random Walk Algorithm; Spatial Search; Quantum Physics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rahaman, M. A. (2009). Search On A Hypercubic Lattice Using Quantum Random Walk. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/972

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

Rahaman, Md Aminoor. “Search On A Hypercubic Lattice Using Quantum Random Walk.” 2009. Thesis, Indian Institute of Science. Accessed July 14, 2020. http://hdl.handle.net/2005/972.

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

MLA Handbook (7th Edition):

Rahaman, Md Aminoor. “Search On A Hypercubic Lattice Using Quantum Random Walk.” 2009. Web. 14 Jul 2020.

Vancouver:

Rahaman MA. Search On A Hypercubic Lattice Using Quantum Random Walk. [Internet] [Thesis]. Indian Institute of Science; 2009. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/2005/972.

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

Council of Science Editors:

Rahaman MA. Search On A Hypercubic Lattice Using Quantum Random Walk. [Thesis]. Indian Institute of Science; 2009. Available from: http://hdl.handle.net/2005/972

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


Vilnius University

16. Lančinskas, Algirdas. Parallelization of random search global optimization algorithms.

Degree: PhD, Informatics, 2013, Vilnius University

Global optimization problems are relevant in various fields of research and industry, such as chemistry, biology, biomedicine, operational research, etc. Normally it is easier to… (more)

Subjects/Keywords: Global optimization; Multi-objective optimization; Random search; Parallel algorithms; Globalusis optimizavimas; Daugiakriteris optimizavimas; Atsitiktinė paieška; Lygiagretieji algoritmai

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lančinskas, A. (2013). Parallelization of random search global optimization algorithms. (Doctoral Dissertation). Vilnius University. Retrieved from http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20130620_110438-17037 ;

Chicago Manual of Style (16th Edition):

Lančinskas, Algirdas. “Parallelization of random search global optimization algorithms.” 2013. Doctoral Dissertation, Vilnius University. Accessed July 14, 2020. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20130620_110438-17037 ;.

MLA Handbook (7th Edition):

Lančinskas, Algirdas. “Parallelization of random search global optimization algorithms.” 2013. Web. 14 Jul 2020.

Vancouver:

Lančinskas A. Parallelization of random search global optimization algorithms. [Internet] [Doctoral dissertation]. Vilnius University; 2013. [cited 2020 Jul 14]. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20130620_110438-17037 ;.

Council of Science Editors:

Lančinskas A. Parallelization of random search global optimization algorithms. [Doctoral Dissertation]. Vilnius University; 2013. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20130620_110438-17037 ;


Vilnius University

17. Lančinskas, Algirdas. Atsitiktinės paieškos globaliojo optimizavimo algoritmų lygiagretinimas.

Degree: Dissertation, Informatics, 2013, Vilnius University

Optimizavimo uždaviniai sutinkami įvairiose mokslo ir pramonės srityse, tokiose kaip chemija, biologija, biomedicina, operacijų tyrimai ir pan. Paprastai efektyviausiai sprendžiami uždaviniai, turintys tam tikras savybes,… (more)

Subjects/Keywords: Gloalusis optimizavimas; Daugiakriteris optimizavimas; Atsitiktinė paieška; Lygiagretieji algoritmai; Global optimization; Multi-objective optimization; Random search; Parallel agorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lančinskas, A. (2013). Atsitiktinės paieškos globaliojo optimizavimo algoritmų lygiagretinimas. (Doctoral Dissertation). Vilnius University. Retrieved from http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20130620_110450-24770 ;

Chicago Manual of Style (16th Edition):

Lančinskas, Algirdas. “Atsitiktinės paieškos globaliojo optimizavimo algoritmų lygiagretinimas.” 2013. Doctoral Dissertation, Vilnius University. Accessed July 14, 2020. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20130620_110450-24770 ;.

MLA Handbook (7th Edition):

Lančinskas, Algirdas. “Atsitiktinės paieškos globaliojo optimizavimo algoritmų lygiagretinimas.” 2013. Web. 14 Jul 2020.

Vancouver:

Lančinskas A. Atsitiktinės paieškos globaliojo optimizavimo algoritmų lygiagretinimas. [Internet] [Doctoral dissertation]. Vilnius University; 2013. [cited 2020 Jul 14]. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20130620_110450-24770 ;.

Council of Science Editors:

Lančinskas A. Atsitiktinės paieškos globaliojo optimizavimo algoritmų lygiagretinimas. [Doctoral Dissertation]. Vilnius University; 2013. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20130620_110450-24770 ;


University of New South Wales

18. Bui, Hoai Thang. Guided random-walk based model checking.

Degree: Computer Science & Engineering, 2009, University of New South Wales

 The ever increasing use of computer systems in society brings emergent challenges to companies and system designers. The reliability of software and hardware can be… (more)

Subjects/Keywords: Heuristic search; Model checking; Guided random-walk

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bui, H. T. (2009). Guided random-walk based model checking. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/44829 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:8128/SOURCE02?view=true

Chicago Manual of Style (16th Edition):

Bui, Hoai Thang. “Guided random-walk based model checking.” 2009. Doctoral Dissertation, University of New South Wales. Accessed July 14, 2020. http://handle.unsw.edu.au/1959.4/44829 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:8128/SOURCE02?view=true.

MLA Handbook (7th Edition):

Bui, Hoai Thang. “Guided random-walk based model checking.” 2009. Web. 14 Jul 2020.

Vancouver:

Bui HT. Guided random-walk based model checking. [Internet] [Doctoral dissertation]. University of New South Wales; 2009. [cited 2020 Jul 14]. Available from: http://handle.unsw.edu.au/1959.4/44829 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:8128/SOURCE02?view=true.

Council of Science Editors:

Bui HT. Guided random-walk based model checking. [Doctoral Dissertation]. University of New South Wales; 2009. Available from: http://handle.unsw.edu.au/1959.4/44829 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:8128/SOURCE02?view=true


KTH

19. Liljeqvist, Sandra. Named Entity Recognition for Search Queries in the Music Domain.

Degree: Computer Science and Communication (CSC), 2016, KTH

This thesis addresses the problem of named entity recognition (NER) in music-related search queries. NER is the task of identifying keywords in text and… (more)

Subjects/Keywords: Natural Language Processing; Information Extraction; Named Entity Recognition; Search Query Semantics; Conditional Random Field; Computer Sciences; Datavetenskap (datalogi)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liljeqvist, S. (2016). Named Entity Recognition for Search Queries in the Music Domain. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-193332

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

Liljeqvist, Sandra. “Named Entity Recognition for Search Queries in the Music Domain.” 2016. Thesis, KTH. Accessed July 14, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-193332.

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

MLA Handbook (7th Edition):

Liljeqvist, Sandra. “Named Entity Recognition for Search Queries in the Music Domain.” 2016. Web. 14 Jul 2020.

Vancouver:

Liljeqvist S. Named Entity Recognition for Search Queries in the Music Domain. [Internet] [Thesis]. KTH; 2016. [cited 2020 Jul 14]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-193332.

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

Council of Science Editors:

Liljeqvist S. Named Entity Recognition for Search Queries in the Music Domain. [Thesis]. KTH; 2016. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-193332

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


University of Western Ontario

20. Brecht, Derek K. A 3-DOF Stewart Platform for Trenchless Pipeline Rehabilitation.

Degree: 2015, University of Western Ontario

 A major component of the infrastructure of any modern city is a network of underground pipes that transport drinking water, storm water and sewage. Most… (more)

Subjects/Keywords: 3-DOF; Stewart Platform; Parameter Optimization; Workspace maximization; Pipeline spraying; Controlled Random Search; Particle Swarm Optimization; Electrical and Computer Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Brecht, D. K. (2015). A 3-DOF Stewart Platform for Trenchless Pipeline Rehabilitation. (Thesis). University of Western Ontario. Retrieved from https://ir.lib.uwo.ca/etd/3156

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

Brecht, Derek K. “A 3-DOF Stewart Platform for Trenchless Pipeline Rehabilitation.” 2015. Thesis, University of Western Ontario. Accessed July 14, 2020. https://ir.lib.uwo.ca/etd/3156.

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

MLA Handbook (7th Edition):

Brecht, Derek K. “A 3-DOF Stewart Platform for Trenchless Pipeline Rehabilitation.” 2015. Web. 14 Jul 2020.

Vancouver:

Brecht DK. A 3-DOF Stewart Platform for Trenchless Pipeline Rehabilitation. [Internet] [Thesis]. University of Western Ontario; 2015. [cited 2020 Jul 14]. Available from: https://ir.lib.uwo.ca/etd/3156.

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

Council of Science Editors:

Brecht DK. A 3-DOF Stewart Platform for Trenchless Pipeline Rehabilitation. [Thesis]. University of Western Ontario; 2015. Available from: https://ir.lib.uwo.ca/etd/3156

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


University of Edinburgh

21. Long, Shun. Adaptive Java optimisation using machine learning techniques.

Degree: PhD, 2004, University of Edinburgh

 There is a continuing demand for higher performance, particularly in the area of scientific and engineering computation. In order to achieve high performance in the… (more)

Subjects/Keywords: 006.3; Unified Transformation Framework; heuristic random search algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Long, S. (2004). Adaptive Java optimisation using machine learning techniques. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/567

Chicago Manual of Style (16th Edition):

Long, Shun. “Adaptive Java optimisation using machine learning techniques.” 2004. Doctoral Dissertation, University of Edinburgh. Accessed July 14, 2020. http://hdl.handle.net/1842/567.

MLA Handbook (7th Edition):

Long, Shun. “Adaptive Java optimisation using machine learning techniques.” 2004. Web. 14 Jul 2020.

Vancouver:

Long S. Adaptive Java optimisation using machine learning techniques. [Internet] [Doctoral dissertation]. University of Edinburgh; 2004. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/1842/567.

Council of Science Editors:

Long S. Adaptive Java optimisation using machine learning techniques. [Doctoral Dissertation]. University of Edinburgh; 2004. Available from: http://hdl.handle.net/1842/567

22. Wolthoff, R.P. Essays on Simultaneous Search Equilibrium.

Degree: 2008, NARCIS

Subjects/Keywords: coordination frictions; directed search; job search; labor economics; labor market; matching; random search; structural estimation; unemployment; vacancies; wages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wolthoff, R. P. (2008). Essays on Simultaneous Search Equilibrium. (Doctoral Dissertation). NARCIS. Retrieved from https://research.vu.nl/en/publications/61ae5558-ec02-4a86-825b-26550ed6ddcb ; urn:nbn:nl:ui:31-1871/12871 ; 61ae5558-ec02-4a86-825b-26550ed6ddcb ; 1871/12871 ; urn:isbn:9789051709285 ; urn:nbn:nl:ui:31-1871/12871 ; https://research.vu.nl/en/publications/61ae5558-ec02-4a86-825b-26550ed6ddcb

Chicago Manual of Style (16th Edition):

Wolthoff, R P. “Essays on Simultaneous Search Equilibrium.” 2008. Doctoral Dissertation, NARCIS. Accessed July 14, 2020. https://research.vu.nl/en/publications/61ae5558-ec02-4a86-825b-26550ed6ddcb ; urn:nbn:nl:ui:31-1871/12871 ; 61ae5558-ec02-4a86-825b-26550ed6ddcb ; 1871/12871 ; urn:isbn:9789051709285 ; urn:nbn:nl:ui:31-1871/12871 ; https://research.vu.nl/en/publications/61ae5558-ec02-4a86-825b-26550ed6ddcb.

MLA Handbook (7th Edition):

Wolthoff, R P. “Essays on Simultaneous Search Equilibrium.” 2008. Web. 14 Jul 2020.

Vancouver:

Wolthoff RP. Essays on Simultaneous Search Equilibrium. [Internet] [Doctoral dissertation]. NARCIS; 2008. [cited 2020 Jul 14]. Available from: https://research.vu.nl/en/publications/61ae5558-ec02-4a86-825b-26550ed6ddcb ; urn:nbn:nl:ui:31-1871/12871 ; 61ae5558-ec02-4a86-825b-26550ed6ddcb ; 1871/12871 ; urn:isbn:9789051709285 ; urn:nbn:nl:ui:31-1871/12871 ; https://research.vu.nl/en/publications/61ae5558-ec02-4a86-825b-26550ed6ddcb.

Council of Science Editors:

Wolthoff RP. Essays on Simultaneous Search Equilibrium. [Doctoral Dissertation]. NARCIS; 2008. Available from: https://research.vu.nl/en/publications/61ae5558-ec02-4a86-825b-26550ed6ddcb ; urn:nbn:nl:ui:31-1871/12871 ; 61ae5558-ec02-4a86-825b-26550ed6ddcb ; 1871/12871 ; urn:isbn:9789051709285 ; urn:nbn:nl:ui:31-1871/12871 ; https://research.vu.nl/en/publications/61ae5558-ec02-4a86-825b-26550ed6ddcb


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 July 14, 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. 14 Jul 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 Jul 14]. 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

24. Faustino, Caio Leite. Aspectos estatísticos em dinâmica de busca em ambientes escassos.

Degree: 2009, Universidade Federal de Alagoas

In this work, we analyze search dynamics and the statistical properties of an organism in search of a target of interest. In general terms, there… (more)

Subjects/Keywords: Dinâmica de busca; Voos de Lévy; Caminhada aleatória; Processos de encontro; Search dynamics; Lévy flights; Random walk; Contact processes; CNPQ::CIENCIAS EXATAS E DA TERRA::FISICA

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Faustino, C. L. (2009). Aspectos estatísticos em dinâmica de busca em ambientes escassos. (Masters Thesis). Universidade Federal de Alagoas. Retrieved from http://www.repositorio.ufal.br/handle/riufal/1001

Chicago Manual of Style (16th Edition):

Faustino, Caio Leite. “Aspectos estatísticos em dinâmica de busca em ambientes escassos.” 2009. Masters Thesis, Universidade Federal de Alagoas. Accessed July 14, 2020. http://www.repositorio.ufal.br/handle/riufal/1001.

MLA Handbook (7th Edition):

Faustino, Caio Leite. “Aspectos estatísticos em dinâmica de busca em ambientes escassos.” 2009. Web. 14 Jul 2020.

Vancouver:

Faustino CL. Aspectos estatísticos em dinâmica de busca em ambientes escassos. [Internet] [Masters thesis]. Universidade Federal de Alagoas; 2009. [cited 2020 Jul 14]. Available from: http://www.repositorio.ufal.br/handle/riufal/1001.

Council of Science Editors:

Faustino CL. Aspectos estatísticos em dinâmica de busca em ambientes escassos. [Masters Thesis]. Universidade Federal de Alagoas; 2009. Available from: http://www.repositorio.ufal.br/handle/riufal/1001

25. Cruz Rodriguez, Joan Neylo da. Análise geoestatística multi-pontos.

Degree: PhD, Estatística, 2013, University of São Paulo

Estimativa e simulação baseados na estatística de dois pontos têm sido usadas desde a década de 1960 na análise geoestatístico. Esses métodos dependem do modelo… (more)

Subjects/Keywords: arvore de busca; estatística multi-pontos; geoestatística; geometria aleatória.; geostatistics; imagem de treinamento; multiple-point statistic; pixels; pixels; random geometry.; search tree; simulação estocástica; stochastic simulation; training image; voxels; voxels

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cruz Rodriguez, J. N. d. (2013). Análise geoestatística multi-pontos. (Doctoral Dissertation). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/45/45133/tde-20092013-113449/ ;

Chicago Manual of Style (16th Edition):

Cruz Rodriguez, Joan Neylo da. “Análise geoestatística multi-pontos.” 2013. Doctoral Dissertation, University of São Paulo. Accessed July 14, 2020. http://www.teses.usp.br/teses/disponiveis/45/45133/tde-20092013-113449/ ;.

MLA Handbook (7th Edition):

Cruz Rodriguez, Joan Neylo da. “Análise geoestatística multi-pontos.” 2013. Web. 14 Jul 2020.

Vancouver:

Cruz Rodriguez JNd. Análise geoestatística multi-pontos. [Internet] [Doctoral dissertation]. University of São Paulo; 2013. [cited 2020 Jul 14]. Available from: http://www.teses.usp.br/teses/disponiveis/45/45133/tde-20092013-113449/ ;.

Council of Science Editors:

Cruz Rodriguez JNd. Análise geoestatística multi-pontos. [Doctoral Dissertation]. University of São Paulo; 2013. Available from: http://www.teses.usp.br/teses/disponiveis/45/45133/tde-20092013-113449/ ;

26. Ilchenko, Alexey. An approach to Graph Isomorphism using Spanning Trees generated by Breadth First Search.

Degree: MSs, Applied Mathematics, 2014, Case Western Reserve University

 Graph Isomorphism is a problem of determining whether or not a bijective function between two graphs exists which also preserves the adjacency relation between nodes.… (more)

Subjects/Keywords: Mathematics; graph isomorphism; spanning tree; breadth first search; random graph

…introduction to trees, graphs, and the Breadth First Search algorithm (central to the next… …section) see [4]. 2.2 Breadth First Search Breadth First Search (BFS)… …in node. Let us call the main node G and call it the main u1 . Breadth First Search… …be deleted. The following is the Breadth First Search algorithm explicitly. In this paper… …code for the Breadth First Search algorithm. Code 1: Breadth First Search algorithm BFS(… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ilchenko, A. (2014). An approach to Graph Isomorphism using Spanning Trees generated by Breadth First Search. (Masters Thesis). Case Western Reserve University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=case1405079402

Chicago Manual of Style (16th Edition):

Ilchenko, Alexey. “An approach to Graph Isomorphism using Spanning Trees generated by Breadth First Search.” 2014. Masters Thesis, Case Western Reserve University. Accessed July 14, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=case1405079402.

MLA Handbook (7th Edition):

Ilchenko, Alexey. “An approach to Graph Isomorphism using Spanning Trees generated by Breadth First Search.” 2014. Web. 14 Jul 2020.

Vancouver:

Ilchenko A. An approach to Graph Isomorphism using Spanning Trees generated by Breadth First Search. [Internet] [Masters thesis]. Case Western Reserve University; 2014. [cited 2020 Jul 14]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=case1405079402.

Council of Science Editors:

Ilchenko A. An approach to Graph Isomorphism using Spanning Trees generated by Breadth First Search. [Masters Thesis]. Case Western Reserve University; 2014. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=case1405079402

27. Lima, Tiago Aécio Grangeiro de Souza Barbosa. Estudos de eficiência em buscas aleatórias unidimensionais .

Degree: 2010, Universidade Federal de Pernambuco

 Neste trabalho investigamos o problema do caminhante aleatório unidimensional como modelo para encontrar que distribuição de probabilidades é a melhor estratégia a ser utilizada na… (more)

Subjects/Keywords: Busca; Aleatória; Caminhante; Lévy; Eficiência; Discretização; Variacional; Browniana; TLC; Superdifusão; Fractalidade; Search; Random; Walker; Lévy; Efficiency; Discretization; Variational; Brownian; CLT; Superdiffusion; Fractality

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lima, T. A. G. d. S. B. (2010). Estudos de eficiência em buscas aleatórias unidimensionais . (Thesis). Universidade Federal de Pernambuco. Retrieved from http://repositorio.ufpe.br/handle/123456789/16645

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

Lima, Tiago Aécio Grangeiro de Souza Barbosa. “Estudos de eficiência em buscas aleatórias unidimensionais .” 2010. Thesis, Universidade Federal de Pernambuco. Accessed July 14, 2020. http://repositorio.ufpe.br/handle/123456789/16645.

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

MLA Handbook (7th Edition):

Lima, Tiago Aécio Grangeiro de Souza Barbosa. “Estudos de eficiência em buscas aleatórias unidimensionais .” 2010. Web. 14 Jul 2020.

Vancouver:

Lima TAGdSB. Estudos de eficiência em buscas aleatórias unidimensionais . [Internet] [Thesis]. Universidade Federal de Pernambuco; 2010. [cited 2020 Jul 14]. Available from: http://repositorio.ufpe.br/handle/123456789/16645.

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

Council of Science Editors:

Lima TAGdSB. Estudos de eficiência em buscas aleatórias unidimensionais . [Thesis]. Universidade Federal de Pernambuco; 2010. Available from: http://repositorio.ufpe.br/handle/123456789/16645

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


Macquarie University

28. Schultheiss, Patrick. Foraging ecology of the Australian desert ant Melophorus bagoti.

Degree: 2012, Macquarie University

Thesis by publication.

Introduction  – 1. Foraging patterns and strategies in an Australian desert ant  – 2. Nest relocation and colony founding in the Australian… (more)

Subjects/Keywords: Ants  – Behavior  – Australia; Ant communities  – Australia; Ants  – Ecology  – Australia; Arid regions ecology  – Australia; Savanna ecology  – Australia; ants; foraging ecology; navigation; search; animal movement; random walk; Lev́y walk

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Schultheiss, P. (2012). Foraging ecology of the Australian desert ant Melophorus bagoti. (Doctoral Dissertation). Macquarie University. Retrieved from http://hdl.handle.net/1959.14/267352

Chicago Manual of Style (16th Edition):

Schultheiss, Patrick. “Foraging ecology of the Australian desert ant Melophorus bagoti.” 2012. Doctoral Dissertation, Macquarie University. Accessed July 14, 2020. http://hdl.handle.net/1959.14/267352.

MLA Handbook (7th Edition):

Schultheiss, Patrick. “Foraging ecology of the Australian desert ant Melophorus bagoti.” 2012. Web. 14 Jul 2020.

Vancouver:

Schultheiss P. Foraging ecology of the Australian desert ant Melophorus bagoti. [Internet] [Doctoral dissertation]. Macquarie University; 2012. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/1959.14/267352.

Council of Science Editors:

Schultheiss P. Foraging ecology of the Australian desert ant Melophorus bagoti. [Doctoral Dissertation]. Macquarie University; 2012. Available from: http://hdl.handle.net/1959.14/267352


Oklahoma State University

29. Solano, Michael. Analyzing Optimal Performance of Evolutionary Search with Restart as Problem Complexity Changes.

Degree: Computer Science Department, 2006, Oklahoma State University

 This research explores how the complexity of a problem domain affects the performance of an evolutionary search using a performance-based restart policy. Previous research indicates… (more)

Subjects/Keywords: genetic programming; evolutionary computation; machine learning; artificial intelligence; evolutionary search; random restart

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Solano, M. (2006). Analyzing Optimal Performance of Evolutionary Search with Restart as Problem Complexity Changes. (Thesis). Oklahoma State University. Retrieved from http://hdl.handle.net/11244/8248

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

Solano, Michael. “Analyzing Optimal Performance of Evolutionary Search with Restart as Problem Complexity Changes.” 2006. Thesis, Oklahoma State University. Accessed July 14, 2020. http://hdl.handle.net/11244/8248.

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

MLA Handbook (7th Edition):

Solano, Michael. “Analyzing Optimal Performance of Evolutionary Search with Restart as Problem Complexity Changes.” 2006. Web. 14 Jul 2020.

Vancouver:

Solano M. Analyzing Optimal Performance of Evolutionary Search with Restart as Problem Complexity Changes. [Internet] [Thesis]. Oklahoma State University; 2006. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/11244/8248.

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

Council of Science Editors:

Solano M. Analyzing Optimal Performance of Evolutionary Search with Restart as Problem Complexity Changes. [Thesis]. Oklahoma State University; 2006. Available from: http://hdl.handle.net/11244/8248

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


Cornell University

30. Brigham, John. COMPUTATIONAL INVERSE SOLUTION STRATEGIES FOR VISCOELASTIC MATERIAL CHARACTERIZATION USING VIBROACOUSTIC METHODS .

Degree: 2008, Cornell University

 Vibroacoustic testing methods are those in which a fluid immersed solid is excited by a remote force, while the resulting acoustic emission in the surrounding… (more)

Subjects/Keywords: viscoelasticity; inverse problems; surrogate-model; random search; proper orthogonal decomposition; optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Brigham, J. (2008). COMPUTATIONAL INVERSE SOLUTION STRATEGIES FOR VISCOELASTIC MATERIAL CHARACTERIZATION USING VIBROACOUSTIC METHODS . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/10904

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

Brigham, John. “COMPUTATIONAL INVERSE SOLUTION STRATEGIES FOR VISCOELASTIC MATERIAL CHARACTERIZATION USING VIBROACOUSTIC METHODS .” 2008. Thesis, Cornell University. Accessed July 14, 2020. http://hdl.handle.net/1813/10904.

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

MLA Handbook (7th Edition):

Brigham, John. “COMPUTATIONAL INVERSE SOLUTION STRATEGIES FOR VISCOELASTIC MATERIAL CHARACTERIZATION USING VIBROACOUSTIC METHODS .” 2008. Web. 14 Jul 2020.

Vancouver:

Brigham J. COMPUTATIONAL INVERSE SOLUTION STRATEGIES FOR VISCOELASTIC MATERIAL CHARACTERIZATION USING VIBROACOUSTIC METHODS . [Internet] [Thesis]. Cornell University; 2008. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/1813/10904.

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

Council of Science Editors:

Brigham J. COMPUTATIONAL INVERSE SOLUTION STRATEGIES FOR VISCOELASTIC MATERIAL CHARACTERIZATION USING VIBROACOUSTIC METHODS . [Thesis]. Cornell University; 2008. Available from: http://hdl.handle.net/1813/10904

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

[1] [2] [3]

.