Dissertations / Theses on the topic 'Local search'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Local search.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Brueggemann, Tobias. "Efficiency of local search." Enschede : University of Twente [Host], 2006. http://doc.utwente.nl/57144.
Full textTairan, Nasser. "Cooperative guided local search." Thesis, University of Essex, 2012. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.573069.
Full textSo, D. G. "Local search and simulation." Thesis, Swansea University, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.639084.
Full textÅgren, Magnus. "Set Constraints for Local Search." Doctoral thesis, Uppsala universitet, Avdelningen för datalogi, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-8373.
Full textSouthey, Finnegan. "Augmenting Local Search for Satisfiability." Thesis, University of Waterloo, 2004. http://hdl.handle.net/10012/1075.
Full textÅgren, Magnus. "Set constraints for local search /." Uppsala : Acta Universitatis Upsaliensis, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-8373.
Full textMills, P. H. "Extensions to Guided Local Search." Thesis, University of Essex, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.391658.
Full textMagnusson, Jesper. "Guiding Local Search using Approximations." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-372074.
Full textMartinsson, Roy. "Software Vulnerability Assessment : local search methods." Thesis, Blekinge Tekniska Högskola, Avdelningen för programvarusystem, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4270.
Full textÅgren, Magnus. "High-level modelling and local search." Licentiate thesis, Uppsala universitet, Avdelningen för datalogi, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-86352.
Full textÅgren, Magnus. "High-level modelling and local search /." Uppsala : Univ. : Dept. of Information Technology, Univ, 2005. http://www.it.uu.se/research/publications/lic/2005-003/.
Full textKhetan, Amit 1978. "Local search for optimizing instruction cache." Thesis, Massachusetts Institute of Technology, 1999. http://hdl.handle.net/1721.1/80076.
Full textCai, Shaowei. "Novel Local Search Methods for Satisfiability." Thesis, Griffith University, 2015. http://hdl.handle.net/10072/366424.
Full textThesis (PhD Doctorate)
Doctor of Philosophy (PhD)
Institute for Integrated and Intelligent Systems
Science, Environment, Engineering and Technology
Full Text
Buljubasic, Mirsad. "Efficient local search for several combinatorial optimization problems." Thesis, Montpellier, 2015. http://www.theses.fr/2015MONTS010/document.
Full textThis Ph.D. thesis concerns algorithms for Combinatorial Optimization Problems. In Combinatorial Optimization Problems the set of feasible solutions is discrete or can be reduced to a discrete one, and the goal is to find the best possible solution. Specifically, in this research we consider three different problems in the field of Combinatorial Optimization including One-dimensional Bin Packing (and two similar problems), Machine Reassignment Problem and Rolling Stock Problem. The first one is a classical and well known optimization problem, while the other two are real world and very large scale problems arising in industry and have been recently proposed by Google and French Railways (SNCF) respectively. For each problem we propose a local search based heuristic algorithm and we compare our results with the best known results in the literature. Additionally, as an introduction to local search methods, two metaheuristic approaches, GRASP and Tabu Search are explained through a computational study on Set Covering Problem
Pfitzner, Darius Mark, and pfit0022@flinders edu au. "An Investigation into User Text Query and Text Descriptor Construction." Flinders University. Computer Science, Engineering and Mathematics, 2009. http://catalogue.flinders.edu.au./local/adt/public/adt-SFU20090805.141402.
Full textGambardella, Luca Maria. "Coupling ant colony system with local search." Doctoral thesis, Universite Libre de Bruxelles, 2015. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/209045.
Full textDoctorat en Sciences de l'ingénieur
info:eu-repo/semantics/nonPublished
Thornton, John Richard, and n/a. "Constraint Weighting Local Search for Constraint Satisfaction." Griffith University. School of Computing and Information Technology, 2000. http://www4.gu.edu.au:8080/adt-root/public/adt-QGU20050901.142439.
Full textKhanum, Rashida Adeeb. "Hybrid evolutionary alogrithms and local search techniques." Thesis, University of Essex, 2013. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.589450.
Full textEhrencrona, Kjellin Patrik. "Airspace Sectorisation Using Constraint-Based Local Search." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-233385.
Full textVoudouris, Christos. "Guided local search for combinatorial optimisation problems." Thesis, University of Essex, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.361019.
Full textBjördal, Gustav. "String Variables for Constraint-Based Local Search." Thesis, Uppsala universitet, Avdelningen för datalogi, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-301501.
Full textXu, Ruoxi. "Regression Model Stochastic Search via Local Orthogonalization." The Ohio State University, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=osu1322589253.
Full textThornton, John. "Constraint Weighting Local Search for Constraint Satisfaction." Thesis, Griffith University, 2000. http://hdl.handle.net/10072/367954.
Full textThesis (PhD Doctorate)
Doctor of Philosophy (PhD)
School of Computing and Information Technology
Science, Environment, Engineering and Technology
Full Text
Shatabda, Swakkhar. "Local Search Heuristics for Protein Structure Prediction." Thesis, Griffith University, 2014. http://hdl.handle.net/10072/365446.
Full textThesis (PhD Doctorate)
Doctor of Philosophy (PhD)
Institute for Integrated and Intelligent Systems
Science, Environment, Engineering and Technology
Full Text
He, Jun. "Constraints for Membership in Formal Languages under Systematic Search and Stochastic Local Search." Doctoral thesis, Uppsala universitet, Avdelningen för datalogi, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-196347.
Full textMadrigali, Andrea. "Analysis of Local Search Methods for 3D Data." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2016.
Find full textBéjar, Torres Ramón. "Systematic and local search algorithms for regular-SAT." Doctoral thesis, Universitat Autònoma de Barcelona, 2000. http://hdl.handle.net/10803/3018.
Full textZahrani, Mohammed Saeed. "Genetic local search algorithms for selected graph problems." Thesis, University of Hertfordshire, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.440188.
Full textWattanawaroon, Tana. "Local versus global tables in Minimax Game Search." Thesis, Massachusetts Institute of Technology, 2014. http://hdl.handle.net/1721.1/92088.
Full textCataloged from PDF version of thesis.
Includes bibliographical references (page 33).
Minimax Game Search with alpha-beta pruning can utilize heuristic tables in order to prune more branches and achieve better performance. The tables can be implemented using different memory models: global tables, worker-local tables and processor-local tables. Depending on whether each heuristic table depends on locality in the game tree, a memory model might be more suitable than others. This thesis describes an experiment that shows that local tables are generally preferable to global tables for two game heuristics used in chess-like games: killer move and best move history. The experiment is evidence that local tables might be useful for multithreaded applications, particularly ones that involve caching and exhibit locality.
by Tana Wattanawaroon.
M. Eng.
Benlic, Una. "Breakout local search pour les problèmes d'optimisation difficiles." Angers, 2012. http://www.theses.fr/2012ANGE0049.
Full textDue to the inherent computational complexity of hard combinatorial optimization prob- lems, the last several decades have seen a surge of interest in using heuristic algorithms to tackle this class of problems. While some of the heuristic methods are problem-specific, others are problem-independent since they ma1‹e few or no assumption about the problem being optimized. Examples of modern problem-independent heuristics are neighborhood search methods like tabu search, iterated local search, or simulated annealing, and biolog- ically inspired methods such as evolutionary algorithms or ant colony optimization. This work is dedicated to the elaboration of a problem-independent heuristic method, named Breakout Local Search (BLS), which can be considered as a combination of several well- established metaheuristic methods. BLS is a variant of iterated local search approach, since its basic idea of to use local search to discover local optima and to employ adaptive diversification strategies to continually move from one local optimum to another in the search space. Based on the information on the state of search, the perturbation strat- egy of BLS introduces a varying degree of diversification by dynamically determining the number of moves for perturbation and by adaptively selecting between several types of dedicated moves. So far, we have tested BLS on a number of classical combinatorial op- timization problems including maximum clique problems (both weighted and unweighted cases), quadratic assignment, graph partitioning, maximum cut and maximum sum col- oring problems. Compared to the current state-of-art algorithms from the literature, the proposed method shows remarkable performance on these problems. For a significant num- ber of instances of maximum weight clique, maximum cut and graph partitioning, as well as for several smaller in9tances of minimum sum coloring problem, our BLS method is even able to attain new record-breaking results. To further improve the performance on graph partitioning and quadratic assignment problems, we additionally present two memetic al- gorithms w'hich use BLS as their local search procedure. Beside providing highly effective methods for a number of hard problems, another objective is also to explain to some extent the behaviour of the proposed approaches on different types of problem structures
Land, Mark William Shannon. "Evolutionary algorithms with local search for combinatorial optimization /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 1998. http://wwwlib.umi.com/cr/ucsd/fullcit?p9914083.
Full textDuong, Thach-Thao Nguyen. "Improving Diversification in Local Search for Propositional Satisfiability." Thesis, Griffith University, 2014. http://hdl.handle.net/10072/365717.
Full textThesis (PhD Doctorate)
Doctor of Philosophy (PhD)
School of Information and Communication Technology
Science, Environment, Engineering and Technology
Full Text
Ferreira, Junior Valnir, and N/A. "Improvements to Clause Weighting Local Search for Propositional Satisfiability." Griffith University. Institute for Integrated and Intelligent Systems, 2007. http://www4.gu.edu.au:8080/adt-root/public/adt-QGU20070823.123257.
Full textFerreira, Junior Valnir. "Improvements to Clause Weighting Local Search for Propositional Satisfiability." Thesis, Griffith University, 2007. http://hdl.handle.net/10072/365857.
Full textThesis (PhD Doctorate)
Doctor of Philosophy (PhD)
Institute for Integrated and Intelligent Systems
Full Text
Goh, Say Leng. "An investigation of Monte Carlo tree search and local search for course timetabling problems." Thesis, University of Nottingham, 2017. http://eprints.nottingham.ac.uk/43558/.
Full textCornu, Marek. "Local Search, data structures and Monte Carlo Search for Multi-Objective Combinatorial Optimization Problems." Thesis, Paris Sciences et Lettres (ComUE), 2017. http://www.theses.fr/2017PSLED043/document.
Full textMany Combinatorial Optimization problems consider several, often conflicting, objectives. This thesis deals with Local Search, data structures and Monte Carlo Search methods for finding the set of efficient solutions of such problems, which is the set of all best possible trade-offs given all the objectives.We propose a new approximation method called 2-Phase Iterated Pareto Local Search based on Decomposition (2PIPLS/D) combining the notions of Pareto Local Search (PLS) and Decomposition. PLS is a local search descent adapted to Multi-Objective spaces, and Decomposition consists in the subdivision of the Multi-Objective problem into a number of Single-Objective problems. Two Single-Objective methods are considered: Iterated Local Search and Nested Monte Carlo Search. Two main components are embedded within the 2PIPLS/D framework. The first one generalizes and improves an existing method generating an initial set of solutions. The second one reduces efficiently the search space and accelerates PLS without notable impact on the quality of the generated approximation. We also introduce two new data structures for dynamically managing a set of incomparable solutions. The first one is specialized for the bi-objective case, while the second one is general.2PIPLS/D is applied to the bi-objective and tri-objective Traveling Salesman Problem and outperforms its competitors on tested instances. Then, 2PIPLS/D is instantiated on a new five-objective problem related to the recent territorial reform of French regions which resulted in the reassignment of departments to new larger regions
Magaji, Amina Sambo-Muhammad. "Combining search strategies for distributed constraint satisfaction." Thesis, Robert Gordon University, 2015. http://hdl.handle.net/10059/1374.
Full textSchuster, Christoph Jörg. "No-wait-Job-Shop-Scheduling: Komplexität und local search." [S.l. : s.n.], 2003. http://deposit.ddb.de/cgi-bin/dokserv?idn=967617308.
Full textGumucio, Escobar Rodrigo Ronald. "Constraints on Set Variables for Constraint-based Local Search." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-159180.
Full textHusain, Syed S. "Robust aggregation of local image descriptors for visual search." Thesis, University of Surrey, 2016. http://epubs.surrey.ac.uk/810765/.
Full textSchuster, Christoph J. "No-wait Job-Shop Scheduling: Komplexität und Local Search." Gerhard-Mercator-Universitaet Duisburg, 2003. http://www.ub.uni-duisburg.de/ETD-db/theses/available/duett-04242003-131618/.
Full textHoffmann, Jörg. "Utilizing problem structure in planning : a local search approach /." Berlin [u.a.] : Springer, 2003. http://www.loc.gov/catdir/enhancements/fy0818/2003065658-d.html.
Full textLindsey, Kathleen A. "Improving freight consolidation networks using IP-based local search." Diss., Georgia Institute of Technology, 2012. http://hdl.handle.net/1853/45786.
Full textKhudabukhsh, Ashiqur Rahman. "SATenstein : automatically building local search SAT solvers from components." Thesis, University of British Columbia, 2009. http://hdl.handle.net/2429/13852.
Full textTompkins, David Andrew Douglas. "Dynamic local search for SAT : design, insights and analysis." Thesis, University of British Columbia, 2010. http://hdl.handle.net/2429/29538.
Full textBjördal, Gustav. "The First Constraint-Based Local Search Backend for MiniZinc." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-234847.
Full textKnowles, Joshua D. "Local-search and hybrid evolutionary algorithms for Pareto optimization." Thesis, University of Reading, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.394429.
Full textHenderson, Darrall. "Assessing the Finite-Time Performance of Local Search Algorithms." Diss., Virginia Tech, 2001. http://hdl.handle.net/10919/26926.
Full textPh. D.
Carson, Ted. "Empirical and analytic approaches to understanding local search heuristics /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2001. http://wwwlib.umi.com/cr/ucsd/fullcit?p9995987.
Full textArthur, David. "Analyzing and improving local search : k-means and ICP /." May be available electronically:, 2009. http://proquest.umi.com/login?COPT=REJTPTU1MTUmSU5UPTAmVkVSPTI=&clientId=12498.
Full text