Relevant bibliographies by topics / Heuristics / Dissertations / Theses
To see the other types of publications on this topic, follow the link: Heuristics.

Dissertations / Theses on the topic 'Heuristics'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Heuristics.'

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.

1

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Monk, Monika Patrice. "Mobile Exergaming Heuristics." Thesis, Virginia Tech, 2014. http://hdl.handle.net/10919/50581.

Full text
Abstract:
An alarming number of adolescents experience obesity and related health issues, in part because of a lack of exercise. Increased mobile technology availability can have negative effects on amount of exercise, but they can have positive effects as well. Leveraging mobile technology to encourage and motivate exercise has potential to decrease unhealthy lifestyles, especially among young people. Mobile exergaming is an emerging field that has the potential to motivate users to exercise while also having fun. However, much of the early development work on mobile exergames has been ad-hoc, with lit
APA, Harvard, Vancouver, ISO, and other styles
3

Yee, Michael 1978. "Inferring noncompensatory choice heuristics." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/36226.

Full text
Abstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2006.<br>Includes bibliographical references (p. 121-128).<br>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 o
APA, Harvard, Vancouver, ISO, and other styles
4

Panthulu, Pradeep. "Intelligent Memory Management Heuristics." Thesis, University of North Texas, 2003. https://digital.library.unt.edu/ark:/67531/metadc4399/.

Full text
Abstract:
Automatic memory management is crucial in implementation of runtime systems even though it induces a significant computational overhead. In this thesis I explore the use of statistical properties of the directed graph describing the set of live data to decide between garbage collection and heap expansion in a memory management algorithm combining the dynamic array represented heaps with a mark and sweep garbage collector to enhance its performance. The sampling method predicting the density and the distribution of useful data is implemented as a partial marking algorithm. The algorithm random
APA, Harvard, Vancouver, ISO, and other styles
5

Petracca, Enrico <1983&gt. "Essays in structural heuristics." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2014. http://amsdottorato.unibo.it/6284/1/Petracca_Enrico_Tesi.pdf.

Full text
Abstract:
This dissertation introduces and develops a new method of rational reconstruction called structural heuristics. Structural heuristics takes assignment of structure to any given object of investigation as the starting point for its rational reconstruction. This means to look at any given object as a system of relations and of transformation laws for those relations. The operational content of this heuristics can be summarized as follows: when facing any given system the best way to approach it is to explicitly look for a possible structure of it. The utilization of structural heuristics allows
APA, Harvard, Vancouver, ISO, and other styles
6

Petracca, Enrico <1983&gt. "Essays in structural heuristics." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2014. http://amsdottorato.unibo.it/6284/.

Full text
Abstract:
This dissertation introduces and develops a new method of rational reconstruction called structural heuristics. Structural heuristics takes assignment of structure to any given object of investigation as the starting point for its rational reconstruction. This means to look at any given object as a system of relations and of transformation laws for those relations. The operational content of this heuristics can be summarized as follows: when facing any given system the best way to approach it is to explicitly look for a possible structure of it. The utilization of structural heuristics allows
APA, Harvard, Vancouver, ISO, and other styles
7

Clark, Andrew J. "Optimisation heuristics for cryptology." Thesis, Queensland University of Technology, 1998. https://eprints.qut.edu.au/15777/1/Andrew_Clark_Thesis.pdf.

Full text
Abstract:
The aim of the research presented in this thesis is to investigate the use of various optimisation heuristics in the fields of automated cryptanalysis and automated cryptographic function generation. These techniques were found to provide a successful method of automated cryptanalysis of a variety of the classical ciphers. Also, they were found to enhance existing fast correlation attacks on certain stream ciphers. A previously proposed attack of the knapsack cipher is shown to be flawed due to the absence of a suitable solution evaluation mechanism. Finally, a new approach for finding highly
APA, Harvard, Vancouver, ISO, and other styles
8

Clark, Andrew J. "Optimisation Heuristics for Cryptology." Queensland University of Technology, 1998. http://eprints.qut.edu.au/15777/.

Full text
Abstract:
The aim of the research presented in this thesis is to investigate the use of various optimisation heuristics in the fields of automated cryptanalysis and automated cryptographic function generation. These techniques were found to provide a successful method of automated cryptanalysis of a variety of the classical ciphers. Also, they were found to enhance existing fast correlation attacks on certain stream ciphers. A previously proposed attack of the knapsack cipher is shown to be flawed due to the absence of a suitable solution evaluation mechanism. Finally, a new approach for finding highly
APA, Harvard, Vancouver, ISO, and other styles
9

Lü, Haili, and 吕海利. "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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Pasch, Kenneth Alan. "Heuristics for Job-Shop Scheduling." Thesis, Massachusetts Institute of Technology, 1988. http://hdl.handle.net/1721.1/6847.

Full text
Abstract:
Two methods of obtaining approximate solutions to the classic General Job-shop Scheduling Program are investigated. The first method is iterative. A sampling of the solution space is used to decide which of a collection of space pruning constraints are consistent with "good" schedules. The selected space pruning constraints are then used to reduce the search space and the sampling is repeated. This approach can be used either to verify whether some set of space pruning constraints can prune with discrimination or to generate solutions directly. Schedules can be represented as tra
APA, Harvard, Vancouver, ISO, and other styles
11

Seib, 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
12

Haslum, 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
13

Sheasby, Janice. "Lagrangean heuristics for vehicle routing." Thesis, Coventry University, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.320251.

Full text
APA, Harvard, Vancouver, ISO, and other styles
14

Aldinger, Johannes [Verfasser], and Bernhard [Akademischer Betreuer] Nebel. "Relaxation heuristics for numeric planning." Freiburg : Universität, 2018. http://d-nb.info/1175875155/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
15

Cox, Karl. "Heuristics for use case descriptions." Thesis, Bournemouth University, 2002. http://eprints.bournemouth.ac.uk/301/.

Full text
Abstract:
Use cases, as part of the Unified Modelling Language, have become an industry standard. The major focus has been on the use case diagram. It is only recently that any detailed attention has been paid to the use case description. The description should be written in such a way as to make it communicable to its reader. However, this does not always appear to be the case. This thesis presents the 7 C's of Communicability as quality features of use case descriptions that make them more comprehensible. The 7 C's are derived from software engineering best practice on use case descriptions and from t
APA, Harvard, Vancouver, ISO, and other styles
16

Gibbon, Cleveland Augustine. "Heuristics for object-oriented design." Thesis, University of Nottingham, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.388318.

Full text
APA, Harvard, Vancouver, ISO, and other styles
17

MENDES, 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.

Full text
Abstract:
COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>Compreensã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 Tab
APA, Harvard, Vancouver, ISO, and other styles
18

Christodoulides, Marios Andreas. "Design heuristics : facilitating architectural thought." Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/65239.

Full text
Abstract:
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Architecture, 1997.<br>Includes bibliographical references (p. 48).<br>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
APA, Harvard, Vancouver, ISO, and other styles
19

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.

Full text
Abstract:
Good design is often derived from user-centred design, and systems have to be too adapted for their users. This delimits the system and the user alike. With poietic design, the system is designed to be less limited and the user is encouraged to get a deeper, more intuitive understanding of how it works. The properties of the proposed design philosophy poietic design are based on theoretical research and examples of artefacts that excel in communicating how they work. The properties, or heuristics, are used to analyse a digital system and a display, and to propose poietic redesigns. An experime
APA, Harvard, Vancouver, ISO, and other styles
20

Sprinkle, Zachary Joseph. "Heuristics in Construction Project Management." Thesis, Virginia Tech, 2019. http://hdl.handle.net/10919/87089.

Full text
Abstract:
Modern construction projects are delivered in complex, fast pace environments. Stakeholders are required to participate in dynamic project settings with resource constraints, information constraints, and time constraints. To overcome gaps in knowledge, to deliver decisions quickly, and to overcome human limits in cognitive ability, decision makers typically employ heuristics, or rules of thumb to arrive at relatively quick answers. Heuristics are cognitive shortcuts that an individual employs to arrive at quick decisions (Goodwin et al., 2004). These heuristics are used in a variety of ways, r
APA, Harvard, Vancouver, ISO, and other styles
21

Elhag, Anas. "Hyper-heuristics for grouping problems." Thesis, University of Nottingham, 2015. http://eprints.nottingham.ac.uk/34217/.

Full text
Abstract:
Grouping problems are hard to solve combinatorial optimization problems which require partitioning of objects into a minimum number of subsets while another additional objective is simultaneously optimized. Considerable research e ort has recently been directed towards automated problem-independent reusable heuristic search methodologies such as hyper-heuristics, which operate on a space formed by a set of low level heuristics rather than solutions, directly. Hyper-heuristics are commonly split into two main categories: selection hyper-heuristics, which are the focus of the work presented in t
APA, Harvard, Vancouver, ISO, and other styles
22

Barsky, David Edward. "Entrepreneurial Heuristics and Serial Entrepreneurs." Diss., Temple University Libraries, 2010. http://cdm16002.contentdm.oclc.org/cdm/ref/collection/p245801coll10/id/66251.

Full text
Abstract:
Business Administration<br>Ph.D.<br>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 think
APA, Harvard, Vancouver, ISO, and other styles
23

Basu, Nandini. "Heuristics for searching chemical structures." Diss., Columbia, Mo. : University of Missouri-Columbia, 2007. http://hdl.handle.net/10355/5000.

Full text
Abstract:
Thesis (M.S.)--University of Missouri-Columbia, 2007.<br>The 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.
APA, Harvard, Vancouver, ISO, and other styles
24

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/.

Full text
Abstract:
A hyper-heuristic is a search method or learning mechanism for selecting or generating heuristics to solve computational search problems. Researchers classify hyper-heuristics according to the source of feedback during learning: Online learning hyper-heuristics learn while solving a given instance of a problem; Offline learning hyper-heuristics learn from a set of training instances, a method that can generalise to unseen instances. Genetic programming (GP) can be considered a specialization of the more widely known genetic algorithms (GAs) where each individual is a computer program. GP autom
APA, Harvard, Vancouver, ISO, and other styles
25

BERGMARK, FABIAN, and 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.

Full text
Abstract:
The subject of computer Go is an active eld under AI and has achieved much attention in research. The current state of the art computer Go im-plementations uses a game tree search approach rather than advanced heuristics. This thesis aims to bridge these two approaches and combineMonte Carlo Tree Search with heuristics to deduce if any general results can be found. The results of the thesis indicate that the performance of a combined MCTS-heuristic approach correlates strongly with performance of the heuristic. Furthermore, MCTS can be used with any heuristic to improve its performance.1
APA, Harvard, Vancouver, ISO, and other styles
26

RAUF, MIAN SHAMS, and 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.

Full text
Abstract:
<p>After 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 entrepreneuria
APA, Harvard, Vancouver, ISO, and other styles
27

Mabrouk, Emad Hamdy Ahmed. "Meta-Heuristics Programming and Its Applications." 京都大学 (Kyoto University), 2011. http://hdl.handle.net/2433/142132.

Full text
APA, Harvard, Vancouver, ISO, and other styles
28

Kolen, A. W. J., Kan A. H. G. Rinnooy, Hoesel C. P. M. Van, and Albert Wagelmans. "Sensitivity Analysis of List Scheduling Heuristics." Massachusetts Institute of Technology, Operations Research Center, 1990. http://hdl.handle.net/1721.1/5268.

Full text
Abstract:
When jobs have to be processed on a set of identical parallel machines so as to minimize the makespan of the schedule, list scheduling rules form a popular class of heuristics. The order in which jobs appear on the list is assumed here to be determined by the relative size of their processing times; well known special cases are the LPT rule and the SPT rule, in which the jobs are ordered according to non-increasing and non-decreasing processing time respectively. When one of the job processing times is gradually increased, the schedule produced by a list scheduling rule will be affected in a m
APA, Harvard, Vancouver, ISO, and other styles
29

Shields, Ian Beaumont. "Hamilton Cycle Heuristics in Hard Graphs." NCSU, 2004. http://www.lib.ncsu.edu/theses/available/etd-03142004-013420/.

Full text
Abstract:
In this thesis, we use computer methods to investigate Hamilton cycles and paths in several families of graphs where general results are incomplete, including Kneser graphs, cubic Cayley graphs and the middle two levels graph. We describe a novel heuristic which has proven useful in finding Hamilton cycles in these families and compare its performance to that of other algorithms and heuristics. We describe methods for handling very large graphs on personal computers. We also explore issues in reducing the possible number of generating sets for cubic Cayley graphs generated by three involutions
APA, Harvard, Vancouver, ISO, and other styles
30

LaDuca, Robert James. "Optimizing steering heuristics for clustered microarchitectures." Diss., Online access via UMI:, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
31

Peterson, 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.

Full text
Abstract:
Thesis (Ph.D.)--Indiana University, School of Education, 2007.<br>Title from dissertation home page (viewed Sept. 26, 2008). Source: Dissertation Abstracts International, Volume: 69-02, Section: A, page: 0493. Adviser: Charles M. Reigeluth.
APA, Harvard, Vancouver, ISO, and other styles
32

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
33

Koshich, P. A. "University course timetabling of meta-heuristics." Thesis, University of Oxford, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.433470.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

Banerjea-Brodeur, Monica. "Selection hyper-heuristics for healthcare scheduling." Thesis, University of Nottingham, 2013. http://eprints.nottingham.ac.uk/14395/.

Full text
Abstract:
A variety of approaches have been used to solve a variety of combinatorial optimisation problems. Many of those approaches are tailored to the particular problem being addressed. Recently, there has been a growing number of studies towards providing more general search methodologies than currently exist which are applicable to different problem domains without requiring any algorithmic modification. Hyper-heuristics represent a class of such general methodologies which are capable of automating the design of search process via generating new heuristics and/or mixing existing heuristics to solv
APA, Harvard, Vancouver, ISO, and other styles
35

VIANNA, 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.

Full text
Abstract:
CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO<br>Uma 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
APA, Harvard, Vancouver, ISO, and other styles
36

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.

Full text
Abstract:
COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>Este 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,
APA, Harvard, Vancouver, ISO, and other styles
37

Bash, K. E. "Spatial poetries : heuristics for experimental poiesis." Thesis, University College London (University of London), 2011. http://discovery.ucl.ac.uk/1337102/.

Full text
Abstract:
The theme of this research is the study of how things take form in experience, consciousness and language. In large part, it explores the identification and the naming of ephemeral event phenomena that are as of yet unnamed, a process of becoming I describe as symmetry-breaking. This exploration is pursued within the framework of a Lived Spatial Inquiry called Experimental Poiesis, a particularly experimental form of making where inquiry is the formal philosophical and poietic tool where the original matrix of the site in question is embedded in what is made. The methods of this inquiry facili
APA, Harvard, Vancouver, ISO, and other styles
38

Ortmann, Frank. "Heuristics for offline rectangular packing problems." Thesis, Stellenbosch : University of Stellenbosch, 2010. http://hdl.handle.net/10019.1/3992.

Full text
Abstract:
Thesis (PhD (Logistics))--University of Stellenbosch, 2010.<br>ENGLISH 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 unbounde
APA, Harvard, Vancouver, ISO, and other styles
39

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.

Full text
Abstract:
After 50 years of fundamental research, domain independent planning has recently started to be applied to numerous real world problems. However, this has shown that the techniques developed until now are not completely mature: improvements can be made in different directions, such as in the area of metric temporal planning. This PhD research is focused on how we can use more sophisticated and informative heuristics in the general context of automated planning, when numeric and temporal constraints are a significant part of the problem. As a starting point, we will use as a reference example th
APA, Harvard, Vancouver, ISO, and other styles
40

Rocha, Leonardo Sampaio. "Algorithmic aspects of graph colouring heuristics." Nice, 2012. https://tel.archives-ouvertes.fr/tel-00759408.

Full text
Abstract:
Une coloration propre d’un graphe est une fonction qui attribue une couleur à chaque sommet du graphe avec la restriction que deux sommets voisins ont des couleurs distinctes. Les colorations permettent de modéliser des problèmes d’ordonnancement, d’allocation de fréquences ou de registres. Le problème de trouver une coloration propre d’un graphe qui minimise le nombre de couleurs est un problème NP-difficile très connu. Dans cette thèse nous étudions le nombre de Grundy et le nombre b-chromatique des graphes, deux paramètres qui permettent d’évaluer quelques heuristiques pour le problème d’e
APA, Harvard, Vancouver, ISO, and other styles
41

Skiöld, David, and 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.

Full text
Abstract:
Abstract - Through our work we validated the symmetry and leniency heuristics used to evaluate content which has been procedurally generated in a mixed-initiative tool called the Evolutionary Dungeon Designer (EDD). This was done by analyzing and comparing how said heuristics differs from what a human player perceives the metrics to be. A user study was performed for which we developed a game for human testers to try and experience different dungeons, in order to collect the data needed for making the necessary comparisons. We propose potential improvements to the metrics that are intended to
APA, Harvard, Vancouver, ISO, and other styles
42

Kaparis, Konstantinos. "Knapsack problems : inequalities, separation and heuristics." Thesis, Lancaster University, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.525341.

Full text
APA, Harvard, Vancouver, ISO, and other styles
43

Lavinus, Joseph W. "Heuristics for laying out information graphs." Thesis, This resource online, 1992. http://scholar.lib.vt.edu/theses/available/etd-12302008-063333/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
44

Kramer, Oliver. "Self-adaptive heuristics for evolutionary computation." Berlin Heidelberg Springer, 2008. http://d-nb.info/991461002/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
45

Fang, Xiao. "Knowledge refreshing: Model, heuristics and applications." Diss., The University of Arizona, 2003. http://hdl.handle.net/10150/289930.

Full text
Abstract:
With the wide application of information technology in organizations, especially the rapid growth of E-Business, masses of data have been accumulated. Knowledge Discovery in Databases (KDD) gives organizations the tools to sift through vast data stores to extract knowledge supporting organizational decision making. Most of the KDD research has assumed that data is static and focused on either efficiency improvement of the KDD process (e.g., designing more efficient KDD algorithms) or business applications of KDD. However, data is dynamic in reality (i.e., new data continuously added in). Knowl
APA, Harvard, Vancouver, ISO, and other styles
46

Alanazi, Fawaz. "Reinforcement learning hyper-heuristics for optimisation." Thesis, University of Nottingham, 2017. http://eprints.nottingham.ac.uk/42204/.

Full text
Abstract:
Hyper-heuristics are search algorithms which operate on a set of heuristics with the goal of solving a wide range of optimisation problems. It has been observed that different heuristics perform differently between different optimisation problems. A hyper-heuristic combines a set of predefined heuristics, and applies a machine learning technique to predict which heuristic is the most suitable to apply at a given point in time while solving a given problem. A variety of machine learning techniques have been proposed in the literature. Most of the existing machine learning techniques are reinfor
APA, Harvard, Vancouver, ISO, and other styles
47

Rocchi, Elena <1986&gt. "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.

Full text
Abstract:
Many problems arising in several and different areas of human knowledge share the characteristic of being intractable in real cases. The relevance of the solution of these problems, linked to their domain of action, has given birth to many frameworks of algorithms for solving them. Traditional solution paradigms are represented by exact and heuristic algorithms. In order to overcome limitations of both approaches and obtain better performances, tailored combinations of exact and heuristic methods have been studied, giving birth to a new paradigm for solving hard combinatorial optimization pro
APA, Harvard, Vancouver, ISO, and other styles
48

Rocchi, Elena <1986&gt. "Model-Based Heuristics for Combinatorial Optimization." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2016. http://amsdottorato.unibo.it/7301/.

Full text
Abstract:
Many problems arising in several and different areas of human knowledge share the characteristic of being intractable in real cases. The relevance of the solution of these problems, linked to their domain of action, has given birth to many frameworks of algorithms for solving them. Traditional solution paradigms are represented by exact and heuristic algorithms. In order to overcome limitations of both approaches and obtain better performances, tailored combinations of exact and heuristic methods have been studied, giving birth to a new paradigm for solving hard combinatorial optimization pro
APA, Harvard, Vancouver, ISO, and other styles
49

Bergmark, 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.

Full text
Abstract:
This paper studies the performance of height-based weighing functions and compares the results to using the commonly used non height-based weighing functions for holes. For every test performed, the heuristic methods studied in this paper performed better than the commonly used heuristic function. This study also analyses the effect of adding levels of prediction to the heuristic algorithm, which increases the average number of cleared lines by a factor of 85 in total. Utilising these methods can provide increased performance for a Tetris AI. The polynomic weighing functions discussed in this
APA, Harvard, Vancouver, ISO, and other styles
50

Kim, 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/.

Full text
Abstract:
Thesis (Ph. D.)--Georgia State University, 2008.<br>Title 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).
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Heuristics' for other source types:
Journal articles Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography