Rozprawy doktorskie na temat „Heuristics”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Heuristics”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.
Peake, Katharine Louise. "Composition heuristics and theories and a proposed heuristic for business writing". CSUSB ScholarWorks, 2007. https://scholarworks.lib.csusb.edu/etd-project/3282.
Pełny tekst źródłaMonk, Monika Patrice. "Mobile Exergaming Heuristics". Thesis, Virginia Tech, 2014. http://hdl.handle.net/10919/50581.
Pełny tekst źródłaMaster of Science
Yee, Michael 1978. "Inferring noncompensatory choice heuristics". Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/36226.
Pełny tekst źródłaIncludes bibliographical references (p. 121-128).
Human decision making is a topic of great interest to marketers, psychologists, economists, and others. People are often modeled as rational utility maximizers with unlimited mental resources. However, due to the structure of the environment as well as cognitive limitations, people frequently use simplifying heuristics for making quick yet accurate decisions. In this research, we apply discrete optimization to infer from observed data if a person is behaving in way consistent with a choice heuristic (e.g., a noncompensatory lexicographic decision rule). We analyze the computational complexity of several inference related problems, showing that while some are easy due to possessing a greedoid language structure, many are hard and likely do not have polynomial time solutions. For the hard problems we develop an exact dynamic programming algorithm that is robust and scalable in practice, as well as analyze several local search heuristics. We conduct an empirical study of SmartPhone preferences and find that the behavior of many respondents can be explained by lexicographic strategies.
(cont.) Furthermore, we find that lexicographic decision rules predict better on holdout data than some standard compensatory models. Finally, we look at a more general form of noncompensatory decision process in the context of consideration set formation. Specifically, we analyze the computational complexity of rule-based consideration set formation, develop solution techniques for inferring rules given observed consideration data, and apply the techniques to a real dataset.
by Michael J. Yee.
Ph.D.
Panthulu, Pradeep. "Intelligent Memory Management Heuristics". Thesis, University of North Texas, 2003. https://digital.library.unt.edu/ark:/67531/metadc4399/.
Pełny tekst źródłaPetracca, Enrico <1983>. "Essays in structural heuristics". Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2014. http://amsdottorato.unibo.it/6284/1/Petracca_Enrico_Tesi.pdf.
Pełny tekst źródłaPetracca, Enrico <1983>. "Essays in structural heuristics". Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2014. http://amsdottorato.unibo.it/6284/.
Pełny tekst źródłaClark, Andrew J. "Optimisation heuristics for cryptology". Thesis, Queensland University of Technology, 1998. https://eprints.qut.edu.au/15777/1/Andrew_Clark_Thesis.pdf.
Pełny tekst źródłaClark, Andrew J. "Optimisation Heuristics for Cryptology". Queensland University of Technology, 1998. http://eprints.qut.edu.au/15777/.
Pełny tekst źródłaLü, Haili, i 吕海利. "A comparative study of assembly job shop scheduling using simulation, heuristics and meta-heuristics". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2011. http://hub.hku.hk/bib/B47029018.
Pełny tekst źródłaPasch, Kenneth Alan. "Heuristics for Job-Shop Scheduling". Thesis, Massachusetts Institute of Technology, 1988. http://hdl.handle.net/1721.1/6847.
Pełny tekst źródłaSeib, Jerod Drew. "Unclear ideology heuristics and voting /". Available to subscribers only, 2006. http://proquest.umi.com/pqdweb?did=1240706151&sid=4&Fmt=2&clientId=1509&RQT=309&VName=PQD.
Pełny tekst źródłaHaslum, Patrik. "Admissible Heuristics for Automated Planning". Doctoral thesis, Linköping : Department of Computer and Information Science, Linköpings universitet, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-6042.
Pełny tekst źródłaSheasby, Janice. "Lagrangean heuristics for vehicle routing". Thesis, Coventry University, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.320251.
Pełny tekst źródłaAldinger, Johannes [Verfasser], i Bernhard [Akademischer Betreuer] Nebel. "Relaxation heuristics for numeric planning". Freiburg : Universität, 2018. http://d-nb.info/1175875155/34.
Pełny tekst źródłaCox, Karl. "Heuristics for use case descriptions". Thesis, Bournemouth University, 2002. http://eprints.bournemouth.ac.uk/301/.
Pełny tekst źródłaGibbon, Cleveland Augustine. "Heuristics for object-oriented design". Thesis, University of Nottingham, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.388318.
Pełny tekst źródłaMENDES, CARLOS RAONI DE ALENCAR. "COVERING CODES: BOUNDS AND HEURISTICS". PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2009. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=15365@1.
Pełny tekst źródłaCompreensão de dados, codificação digital da fala, telecomunicações via celular, correção de erros de transmissão, são algumas das aplicações práticas do estudo dos códigos de cobertura, um importante ramo da área da matemática denominada teoria dos códigos. Neste trabalho são abordados dois problemas de códigos de cobertura: o problema clássico de códigos de cobertura e o recente problema denominado de códigos curtos de cobertura. Apresenta-se uma aplicação da metaeurística Busca Tabu Reativa, uma importante variação da Busca Tabu clássica, para os problemas citados. Além disto, apresenta-se uma nova técnica heurística para resolução de problemas de otimização combinatória denominada Heurística de Melhoria via Geração de Colunas (HMGC), juntamente com uma aplicação da mesma aos problemas em questão. A HMGC combina a geração atrasada de colunas, técnica usada na resolução de problemas com um grande número de variáveis de decisão (colunas), e heurísticas de busca local. É feita uma comparação dos resultados obtidos pela Busca Tabu Reativa, a Busca Tabu sem o mecanismo de reação e a HMGC, de forma a avaliar a qualidade das heurísticas apresentadas.
Data compression, speech coding, móbile telecommunications and error-corretion are some of the practical apllications of the covering codes study, an important field of coding theory. This work addresses two problems of covering codes: the classic code covering problem and the recent short code covering problem. It presents an application of Reactive Tabu Search (RTS) metaheuristic for the problems cited, the RTS is an important variation of the classic Tabu Search. Moreover, it presents a new heuristic technique for solving combinatorial optimization problems named Column Generation Improbement Heuristic (CGIH). It also presents an application of CGIH for the covering codes problems. The CGIH combines the delayed column generation, technique used to solve problems with a large number of decision variables (columns), and local search heuristics. A comparison of results obtained by the Reactive Tabu Search, the Tabu Search without the reaction mechanism and the CGIH is also presented in order to assess the effectivenss of the presented heuristics.
Christodoulides, Marios Andreas. "Design heuristics : facilitating architectural thought". Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/65239.
Pełny tekst źródłaIncludes bibliographical references (p. 48).
As D A Schon describes the problem space is not given with the presentation of the design task, but constructed by the designer as he/she invents the moves by which he/she attempts to find solutions. From such a design process two episodes emerge, the first one comprised of all the moves a designer makes to construct and organize a problem space, and the second one describing how a designer might navigate through such a problem space in his/her attempt to arrive at solutions. It is the methods which designers use in these episodes which I define as 'design heuristics'. These can facilitate the early stages of the design process in several ways. First they can help set up a platform upon which designers can begin to operate, and which can become the catalyst for further development and refinement to occur. Secondly, they help introduce into the problem space any concerns the designer chooses to address, whether those emerge from site, climate, or other potential factors. These help to complement programmatic concerns, set up hierarchies, and subsequently help the designer determine the important aspects of the problem he/she is attempting to address. Thirdly, the introduction of different 'design heuristics' in both episodes of the design process helps to limit the range of possible solutions, and therefore eliminate the need for exhaustive search. In this thesis an iterative process of investigation is carried out in order to gain a better understanding into the nature of different 'design heuristics' and examine the potential for the development of a tool that can facilitate their implementation. Different categories of rules are introduced in an attempt to create an environment where deSign operations, independent of particular design problems, can be identified. Rules such as the grid, line, and boundary are implemented to investigate concepts of alignment, articulation, and envelope respectively. A random generator is used upon which these rules are superimposed, allowing for a better understanding of the potential and limitations of single rules, or combinations of them. The careful evaluation of a series of experimental products gave rise to a series of concepts that could be critical in the development of an appropriate tool offering more insight as to how one should proceed next. Introducing 'flexibility' for each one of these rules allowed for the development of hierarchies of importance among the different heuristics a deSigner might choose to apply. 'Directional constraints' for each of the rules emerged as critical allowing the development of different variants from each one of the rules described above. The grid for example could have different constrains in anyone of its three axis. The 'sequence' by which these rules are applied emerged as important in the articulation of each one of these rules. The rule applied first would have to compromise the most following the application of subsequent rules. The careful study of products utilizing different variations of such concepts gave better insight as to how these concepts might be further developed and also allowed for new ones to emerge. Furthermore an attempt is made to address both episodes described above by defining a stage of 'generation' followed by a stage of 'post-generation control'. A collection of such concepts can begin to clarify some of the operations that are part of the design activity, setting up the ground for the development of a design tool that facilitates the application of heuristics in the early stages of the design process.
by Marios Andreasa Christodoulides.
M.S.
Löfvenberg, Johanna. "Poietic design : Heuristics and applications". Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-297084.
Pełny tekst źródłaSprinkle, Zachary Joseph. "Heuristics in Construction Project Management". Thesis, Virginia Tech, 2019. http://hdl.handle.net/10919/87089.
Pełny tekst źródłaMaster of Science
Elhag, Anas. "Hyper-heuristics for grouping problems". Thesis, University of Nottingham, 2015. http://eprints.nottingham.ac.uk/34217/.
Pełny tekst źródłaBarsky, David Edward. "Entrepreneurial Heuristics and Serial Entrepreneurs". Diss., Temple University Libraries, 2010. http://cdm16002.contentdm.oclc.org/cdm/ref/collection/p245801coll10/id/66251.
Pełny tekst źródłaPh.D.
This dissertation is comprised of three separate entrepreneurship papers. Paper 1, "Entrepreneurial Heuristics...", found that being mentored, rather than either having extensive higher education or more work experience, was primarily responsible for entrepreneurs acquiring the simplified decision rules (heuristics) that can be useful to them in their business pursuits. The study also found that entrepreneurs do not seem to switch their decision making processes from a "rational man" (thorough) mode to a more abbreviated, heuristic mode as some current thinking suggests. Also in Paper 1 this researcher presented and utilized a 27 item heuristics scale which was used to identify "use of heuristics" by the entrepreneurs studied. Paper 2, "Female Serial Entrepreneurs...", examined the characteristics of female serial entrepreneurs (SE's) as a group of growing size and importance. Three areas- business size, hours worked in the business, and amount and type of capital raised- were explored through contrasting female SE's with female non-SE's and male SE's. The primary findings were as follows: the businesses of female SE's are larger than those of female non-SE's, and female SE's in the professional, technical and scientific services industry borrow more debt than female SE's in this industry, but they do not work longer hours than female non-SE's. It was also found that female SE businesses, in the industries examined in the study, have come to rival male SE businesses in size, as measured in revenues. Paper 3, "The Serial Entrepreneur Dilemma...", explained a conundrum: why serial entrepreneurs do not seem to outperform novice entrepreneurs. A literature review is given consisting of the scholarly thinking about the causes of the conundrum, and then three hypotheses are tested to explore the dilemma. It was found that looking at serial entrepreneurs and novices over time, rather than cross-sectionally, helps to explain the conundrum: the SE's are willing to take losses early on (thus not performing higher than the novices) in expectation of future profits. It was also found that in slow-moving industries, serial entrepreneurs performed much better than novice entrepreneurs in revenues, whereas in fast-moving industries the difference between the two groups in performance was negligible.
Temple University--Theses
Basu, Nandini. "Heuristics for searching chemical structures". Diss., Columbia, Mo. : University of Missouri-Columbia, 2007. http://hdl.handle.net/10355/5000.
Pełny tekst źródłaThe entire dissertation/thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file (which also appears in the research.pdf); a non-technical general description, or public abstract, appears in the public.pdf file. Title from title screen of research.pdf file (viewed Apr. 9, 2009). Includes bibliographical references.
Hong, Libin. "Hyper-heuristic approaches to automatically designing heuristics as mutation operators for evolutionary programming on function classes". Thesis, University of Nottingham, 2018. http://eprints.nottingham.ac.uk/52348/.
Pełny tekst źródłaBERGMARK, FABIAN, i JOHAN STENBERG. "Heuristics in MCTS-based Computer Go : Can heuristics improve the performance of MCTS-based computer go?" Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-157529.
Pełny tekst źródłaRAUF, MIAN SHAMS, i MOHAMMAD ZAINULLAH. "Entrepreneurial Learning, Heuristics and Venture Creation". Thesis, Jönköping University, JIBS, EMM (Entrepreneurship, Marketing, Management), 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-9335.
Pełny tekst źródłaAfter rigorous criticism on trait approach and with the emergence of behavioral approach in entrepreneurship during 1980s, the researchers started to introduce learning and cognitive theories in entrepreneurship to describe and explain the dynamic nature of entrepreneurship. Many researchers have described venture creation as a core and the single most important element of entrepreneurship. This thesis will discuss and present the role of entrepreneurial learning and heuristics in venture creation. Hence, the purpose of this research thesis is to study and analyze the role of entrepreneurial learning and heuristics in venture creation.
To fulfill the purpose of this thesis, we followed qualitative research and conducted semi structured interviews with open ended questionnaires to collect empirical data. For this study, we have included only four interviews which were conducted on four different businesses based in Jönköping, Sweden, following convenience sampling. In the analysis, we used data analysis model of Walker, Cooke and McAllister (2008) and inductively generated three propositions, depicting the role and importance of entrepreneurial learning and heuristics in venture creation.
Individuals adopt entrepreneurship in their careers with necessary skills, abilities, and knowledge, which are learned or gained through experiential learning and/or vicarious learning (i.e., learning by observing or modeling the actions of others). Learning by doing is considered the most important factor by entrepreneurs which helped them to overcome different business start up hurdles, to make various entrepreneurial decisions and to perform many entrepreneurial activities during venture creation. Similarly, individuals within their own situation use, learning by observing or modeling other people’s behaviour, actions and consequences of the actions. Entrepreneurs use learning by modeling the behaviour and actions of others as benchmarking strategy during venture creation. Entrepreneurs believe that without any learning they will not be able to start their own businesses. Heuristics as decisions making mechanism, particularly during venture creation, is used by entrepreneurs as simplifying strategy when sufficient information related to a specific market, certain industry and products are scarce. Additionally, entrepreneurs are passionate to grab profitable business opportunity, and due to time pressure and brief window of opportunity, they can’t go for gathering each and every information of the potential business or product. Hence, heuristics as decisions making mechanism is considered the best suitable approach to make many entrepreneurial decisions during venture creation.
Mabrouk, Emad Hamdy Ahmed. "Meta-Heuristics Programming and Its Applications". 京都大学 (Kyoto University), 2011. http://hdl.handle.net/2433/142132.
Pełny tekst źródłaKolen, A. W. J., Kan A. H. G. Rinnooy, Hoesel C. P. M. Van i Albert Wagelmans. "Sensitivity Analysis of List Scheduling Heuristics". Massachusetts Institute of Technology, Operations Research Center, 1990. http://hdl.handle.net/1721.1/5268.
Pełny tekst źródłaShields, Ian Beaumont. "Hamilton Cycle Heuristics in Hard Graphs". NCSU, 2004. http://www.lib.ncsu.edu/theses/available/etd-03142004-013420/.
Pełny tekst źródłaLaDuca, Robert James. "Optimizing steering heuristics for clustered microarchitectures". Diss., Online access via UMI:, 2006.
Znajdź pełny tekst źródłaPeterson, Bruce Jeffrey. "An instructional design model for heuristics". [Bloomington, Ind.] : Indiana University, 2007. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:3297107.
Pełny tekst źródłaTitle from dissertation home page (viewed Sept. 26, 2008). Source: Dissertation Abstracts International, Volume: 69-02, Section: A, page: 0493. Adviser: Charles M. Reigeluth.
Catanas, Fernando Jorge de Lyz Girou Rodrigues. "Heuristics for the dynamic portfolio problem". Thesis, Imperial College London, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.322226.
Pełny tekst źródłaKoshich, P. A. "University course timetabling of meta-heuristics". Thesis, University of Oxford, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.433470.
Pełny tekst źródłaBanerjea-Brodeur, Monica. "Selection hyper-heuristics for healthcare scheduling". Thesis, University of Nottingham, 2013. http://eprints.nottingham.ac.uk/14395/.
Pełny tekst źródłaVIANNA, DALESSANDRO SOARES. "HYBRID HEURISTICS FOR THE PHYLOGENY PROBLEM". PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2004. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=5178@1.
Pełny tekst źródłaUma filogenia é uma árvore que relaciona unidades taxonômicas, baseada na similaridade de seus conjuntos de características. O problema da filogenia consiste em encontrar uma filogenia com o número mínimo de passos evolutivos. O principal objetivo deste trabalho é desenvolver heurísticas híbridas para este problema. Duas estratégias são propostas. A primeira combina a metaheurística GRASP baseada em uma nova estrutura de vizinhança (k-SPR) proposta neste trabalho com um procedimento VND de busca local. A segunda estratégia híbrida combina algoritmos genéticos com uma estratégia de cruzamento inovadora, a qual é uma extensão da técnica de intensificação denominada reconexão por caminhos que foi originalmente aplicada no contexto de outras metaheurísticas, tais como busca tabu e GRASP. Os experimentos computacionais realizados sobre instâncias geradas aleatoriamente e instâncias da literatura científica mostram que os novos algoritmos são bastante robustos e que superaram os outros algoritmos existentes na literatura em termos de qualidade de solução e tempos computacionais obtidos.
A phylogeny is a tree that relates taxonomic units, based on their similarities over a set of characters. The phylogeny problem consists in finding a phylogeny with the minimum number of evolutionary steps. The main goal of this work is to develop hybrid heuristics for this problem. Two strategies are proposed. The first combines the GRASP metaheuristic using a new neighborhood structure (k-SPR) proposed in this work with a VND local search procedure. The second hybrid strategy combines genetic algorithms with an innovative optimized crossover strategy which is an extension of the path-relinking intensification technique originally applied in the context of other metaheuristics such as tabu search and GRASP. Computational results on randomly generated and benchmark instances are reported, showing that the new heuristics are quite robust and outperform the others algorithms in the literature in terms of solution quality and computational time.
AMARAL, FERNANDO NAUFEL DO. "TOPOS-BASED MODEL THEORY FOR HEURISTICS". PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2004. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=5254@1.
Pełny tekst źródłaEste trabalho emprega conceitos e ferramentas de Teoria das Categorias e Teoria de Topoi para construir um modelo matemático de problemas, reduções entre problemas, espaços e estratégias de busca heurística. Mais precisamente, uma estratégia de construção de espaços de busca é representada por um funtor de uma certa categoria de problemas para uma certa categoria de florestas. A coleção de todos estes funtores forma um topos, um modelo específico equipado com uma lógica interna própria. Esta lógica interna é usada, então, para definir estratégias de busca e heurísticas em Teoria Local dos Conjuntos. Possíveis aplicações do trabalho incluem (1) a especificação lógica e a classificação de heurísticas e meta-heurísticas usadas na prática e (2) uma versão mais abstrata e geral de resultados específicos relacionando a estrutura de problemas com métodos de resolução adequados.
This work employs concepts and tools from Category Theory and Topos Theory to construct a mathematical model for problems, reductions between problems, heuristic search spaces and strategies. More precisely, a search space construction strategy is represented by a functor from a certain category of problems to a certain category of forests. The collection of all such functors forms a topos, a specific model equipped with its own internal logic. This internal logic is then used to define search satrategies and heuristics in Local Set Theory. Possible applications of this work include (1) the logical specification and classification of heuristics and metaheuristics used in pratice and (2) a more abstract and general rendering of specific results relating the structure of problems to adequate problem-solving methods.
Bash, K. E. "Spatial poetries : heuristics for experimental poiesis". Thesis, University College London (University of London), 2011. http://discovery.ucl.ac.uk/1337102/.
Pełny tekst źródłaOrtmann, Frank. "Heuristics for offline rectangular packing problems". Thesis, Stellenbosch : University of Stellenbosch, 2010. http://hdl.handle.net/10019.1/3992.
Pełny tekst źródłaENGLISH ABSTRACT: Packing problems are common in industry and there is a large body of literature on the subject. Two packing problems are considered in this dissertation: the strip packing problem and the bin packing problem. The aim in both problems is to pack a speci ed set of small items, the dimensions of which are all known prior to packing (hence giving rise to an o ine problem), into larger objects, called bins. The strip packing problem requires packing these items into a single bin, one dimension of which is unbounded (the bin is therefore referred to as a strip). In two dimensions the width of the strip is typically speci ed and the aim is to pack all the items into the strip, without overlapping, so that the resulting packing height is a minimum. The bin packing problem, on the other hand, is the problem of packing the items into a speci ed set of bins (all of whose dimensions are bounded) so that the wasted space remaining in the bins (which contain items) is a minimum. The bins may all have the same dimensions (in which case the problem is known as the single bin size bin packing problem), or may have di erent dimensions, in which case the problem is called the multiple bin size bin packing problem (MBSBPP). In two dimensions the wasted space is the sum total of areas of the bins (containing items) not covered by items. Many solution methodologies have been developed for above-mentioned problems, but the scope of the solution methodologies considered in this dissertation is restricted to heuristics. Packing heuristics follow a xed set of rules to pack items in such a manner as to nd good, feasible (but not necessarily optimal) solutions to the strip and bin packing problems within as short a time span as possible. Three types of heuristics are considered in this dissertation: (i) those that pack items into levels (the heights of which are determined by the heights of the tallest items in these levels) in such a manner that all items are packed along the bottom of the level, (ii) those that pack items into levels in such a manner that items may be packed anywhere between the horizontal boundaries that de ne the levels, and (iii) those heuristics that do not restrict the packing of items to levels. These three classes of heuristics are known as level algorithms, pseudolevel algorithms and plane algorithms, respectively. A computational approach is adopted in this dissertation in order to evaluate the performances of 218 new heuristics for the strip packing problem in relation to 34 known heuristics from the literature with respect to a set of 1 170 benchmark problem instances. It is found that the new level-packing heuristics do not yield signi cantly better solutions than the known heuristics, but several of the newly proposed pseudolevel heuristics do yield signi cantly better results than the best of the known pseudolevel heuristics in terms of both packing densities achieved and computation times expended. During the evaluation of the plane algorithms two classes of heuristics were identi ed for packing problems, namely sorting-dependent and sortingindependent algorithms. Two new sorting techniques are proposed for the sorting-independent algorithms and one of them yields the best-performing heuristic overall. A new heuristic approach for the MBSBPP is also proposed, which may be combined with level and pseudolevel algorithms for the strip packing problem in order to nd solutions to the problem very rapidly. The best-performing plane-packing heuristic is modi ed to pack items into the largest bins rst, followed by an attempted repacking of the items in those bins into smaller bins with the aim of further minimising wasted space. It is found that the resulting plane-packing algorithm yields the best results in terms of time and packing density, but that the solution di erences between pseudolevel algorithms are not as marked for the MBSBPP as for the strip packing problem.
AFRIKAANSE OPSOMMING: Inpakkingsprobleme kom algemeen in die industrie voor en daar is 'n aansienlike volume literatuur oor hierdie onderwerp. Twee inpakkingsprobleme word in hierdie proefskrif oorweeg, naamlik die strook-inpakkingsprobleem en die houer-inpakkingsprobleem. In beide probleme is die doel om 'n gespesi seerde versameling klein voorwerpe, waarvan die dimensies almal voordat inpakking plaasvind, bekend is (en die probleem dus 'n sogenaamde a yn-probleem is), in een of meer groter houers te pak. In die strook-inpakkingsprobleem word hierdie voorwerpe in een houer, waarvan een dimensie onbegrens is, ingepak (hierdie houer word dus 'n strook genoem). In twee dimensies word die wydte van die strook gewoonlik gespesi seer en is die doel om al die voorwerpe sonder oorvleueling op s o 'n manier in die strook te pak dat die totale inpakkingshoogte geminineer word. In die houer-inpakkingsprobleem, daarenteen, is die doel om die voorwerpe op s o 'n manier in 'n gespesi seerde aantal houers (waarvan al die dimensies begrens is) te pak dat die vermorste of oorblywende ruimte in die houers (wat wel voorwerpe bevat) 'n minimum is. Die houers mag almal dieselfde dimensies h^e (in welke geval die probleem as die enkelgrootte houer-inpakkingsprobleem bekend staan), of mag verskillende dimensies h^e (in welke geval die probleem as die veelvuldige-grootte houer-inpakkingsprobleem bekend staan, afgekort as VGHIP). In twee dimensies word die vermorste ruimte geneem as die somtotaal van daardie deelareas van die houers (wat wel voorwerpe bevat) waar daar geen voorwerpe geplaas word nie. Verskeie oplossingsmetodologie e is al vir die bogenoemde twee inpakkingsprobleme ontwikkel, maar die bestek van die metodologie e wat in hierdie proefskrif oorweeg word, word beperk tot heuristieke. 'n Inpakkingsheuristiek volg 'n vaste stel re els waarvolgens voorwerpe in houers gepak word om so spoedig moontlik goeie, toelaatbare (maar nie noodwendig optimale) oplossings tot die strook-inpakkingsprobleem en die houer-inpakkingsprobleem te vind. Drie tipes inpakkingsheuristieke word in hierdie proefskrif oorweeg, naamlik (i) heuristieke wat voorwerpe langs die onderste randte van horisontale vlakke in die houers pak (die hoogtes van hierdie vlakke word bepaal deur die hoogtes van die hoogste item in elke vlak), (ii) heuristieke wat voorwerpe op enige plek binne horisontale stroke in die houers pak, en (iii) heuristieke waar inpakking nie volgens horisontale vlakke of stroke beperk word nie. Hierdie drie klasse heuristieke staan onderskeidelik as vlakalgoritmes, pseudo-vlakalgoritmes en platvlakalgoritmes bekend. 'n Berekeningsbenadering word in hierdie proefskrif gevolg deur die werkverrigting van die 218 nuwe heuristieke vir die strook-inpakkingsprobleem met die werkverrigting van 34 bekende heuristieke uit die literatuur te vergelyk, deur al die heuristieke op 1 170 toetsprobleme toe te pas. Daar word bevind dat die nuwe vlakalgoritmes nie 'n noemenswaardige verbetering in oplossingskwaliteit in vergeleke met soortgelyke bestaande algoritmes in die literatuur lewer nie, maar dat verskeie nuwe pseudo-vlakalgoritmes wel noemenswaardige verbeteringe in terme van beide inpakkingsdigthede en oplossingstye in vergeleke met die beste bestaande algoritmes in die literatuur lewer. Assessering van die platvlakalgoritmes het gelei tot die identi kasie van twee deelklasse van algoritmes, naamlik sorteringsafhanklike- en sorteringsonafhanklike algoritmes. Twee nuwe sorteringstegnieke word ook vir die deelklas van sorteringsonafhanklike algoritmes voorgestel, en een van hulle lewer die algeheel beste inpakkingsheursitiek. 'n Nuwe heuristiese benadering word ook vir die VGHIP ontwikkel. Hierdie benadering kan met vlak- of pseudo-vlakalgoritmes vir die strook-inpakkingsprobleem gekombineer word om baie vinnig oplossings vir die VGHIP te vind. Die beste platvlakheuristiek vir die strookinpakkingsprobleem word ook aangepas om voorwerpe eers in die grootste houers te pak, en daarna in kleiner houers te herpak met die doel om vermorste ruimte verder te minimeer. Daar word bevind dat die resulterende platvlakalgoritme die beste resultate in terme van beide inpakkingsdigtheid en oplossingstyd lewer, maar dat oplossingsverskille tussen die pseudovlakalgoritmes nie so opmerklik vir die VGHIP is as wat die geval met die strookinpakkingsprobleem was nie.
Piacentini, Chiara. "Enhanced heuristics for numeric temporal planning". Thesis, King's College London (University of London), 2015. https://kclpure.kcl.ac.uk/portal/en/theses/enhanced-heuristics-for-numeric-temporal-planning(8b51dcec-1714-41b5-9e73-dfb5a0f685e6).html.
Pełny tekst źródłaRocha, Leonardo Sampaio. "Algorithmic aspects of graph colouring heuristics". Nice, 2012. https://tel.archives-ouvertes.fr/tel-00759408.
Pełny tekst źródłaA proper coloring of a graph is a function that assigns a color to each vertex with the restriction that adjacent vertices are assigned with distinct colors. Proper colorings are a natural model for many problems, like scheduling, frequency assignment and register allocation. The problem of finding a proper coloring of a graph with the minimum number of colors is a well-known NP-hard problem. In this thesis we study the Grundy number and the b-chromatic number of graphs, two parameters that evaluate some heuristics for finding proper colorings. We start by giving the state of the art of the results about these parameters. Then, we show that the problem of determining the Grundy Number of bipartite or chordal graphs is NP-hard, but it is solvable in polynomial time for P5-free bipartite graphs. After, we show that the problem of determining the b-chromatic number or a chordal distance-hereditary graph is NP-hard, and we give polynomial-time algorithms for some subclasses of block graphs, complement of bipartite graphs and p4-sparse graphs. We also consider the fixed-parameter tractability of determining the Grundy number and the b-chromatic number, and in particular we show that deciding if the Grundy number (or the b-chromatic number) of a graph G is at least V(G)-k admits an FPT algorithm when k is the parameter. Finally, we consider the computational complexity of many problems related to comparing the b-chromatic number and the Grundy number with various other related parameter of a graph
Skiöld, David, i Kristian Toro. "Comparing Evaluation Heuristics with Human Testers". Thesis, Malmö universitet, Fakulteten för teknik och samhälle (TS), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-20637.
Pełny tekst źródłaKaparis, Konstantinos. "Knapsack problems : inequalities, separation and heuristics". Thesis, Lancaster University, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.525341.
Pełny tekst źródłaLavinus, Joseph W. "Heuristics for laying out information graphs". Thesis, This resource online, 1992. http://scholar.lib.vt.edu/theses/available/etd-12302008-063333/.
Pełny tekst źródłaKramer, Oliver. "Self-adaptive heuristics for evolutionary computation". Berlin Heidelberg Springer, 2008. http://d-nb.info/991461002/34.
Pełny tekst źródłaFang, Xiao. "Knowledge refreshing: Model, heuristics and applications". Diss., The University of Arizona, 2003. http://hdl.handle.net/10150/289930.
Pełny tekst źródłaAlanazi, Fawaz. "Reinforcement learning hyper-heuristics for optimisation". Thesis, University of Nottingham, 2017. http://eprints.nottingham.ac.uk/42204/.
Pełny tekst źródłaRocchi, Elena <1986>. "Model-Based Heuristics for Combinatorial Optimization". Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2016. http://amsdottorato.unibo.it/7301/1/rocchi_elena_tesi.pdf.
Pełny tekst źródłaRocchi, Elena <1986>. "Model-Based Heuristics for Combinatorial Optimization". Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2016. http://amsdottorato.unibo.it/7301/.
Pełny tekst źródłaBergmark, Max. "Tetris: A Heuristic Study : Using height-based weighing functions and breadth-first search heuristics for playing Tetris". Thesis, KTH, Skolan för teknikvetenskap (SCI), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-168306.
Pełny tekst źródłaKim, Dong-Gook. "An Analysis of Ecological and Social Rationality: When are Lexicographic Heuristics Preferred?" unrestricted, 2008. http://etd.gsu.edu/theses/available/etd-08182008-212550/.
Pełny tekst źródłaTitle from file title page. Thomas Whalen, committee chair; Julian Diaz III, C. S. Thachenkary, Rodney Schultz, committee members. Electronic text (168 p. : ill. (some col.)) : digital, PDF file. Description based on contents viewed November 3, 2008. Includes bibliographical references (p. 164-168).