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

Dissertations / Theses on the topic 'Heuristic'

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 'Heuristic.'

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

Ambrogi, Timothy. "Heuristic counterpoint." Diss., Connect to the thesis, 2004. http://hdl.handle.net/10066/1484.

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

Murthy, Sapna Guniguntla. "Disaster recovery heuristic : a mapping heuristic for optimum retrieval /." Online version of thesis, 2009. http://hdl.handle.net/1850/10733.

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

GUTIERRES, RICARDO. "ADAPTIVE HEURISTIC CONTROLLERS." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 1991. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=9409@1.

Full text
Abstract:
CENTRO DE PESQUISAS LEOPOLDO AMÉRICO MIGUEZ DE MELLO<br>Um controlador Heurístico Adaptativo baseia-se num conjunto de regras lingüísticas para conduzir um processo com modelo impreciso ou complexo ao estado desejado. O comportamento do processo deve respeitar os requisitos de performance predefinidos. Para satisfazer estes objetivos, a estrutura interna do controle sofre mudanças para adequá- la as condições vigentes no processo. Os métodos de adaptação abordados consideram a modificação de uma estrutura matricial interpretada como as correções incrementais, compatíveis com os ajustes
APA, Harvard, Vancouver, ISO, and other styles
5

Perry, Kristine. "Heuristic weighted voting /." Diss., CLICK HERE for online access, 2007. http://contentdm.lib.byu.edu/ETD/image/etd2120.pdf.

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

Monteith, Kristine Perry. "Heuristic Weighted Voting." BYU ScholarsArchive, 2007. https://scholarsarchive.byu.edu/etd/1206.

Full text
Abstract:
Selecting an effective method for combining the votes of classifiers in an ensemble can have a significant impact on the overall classification accuracy an ensemble is able to achieve. With some methods, the ensemble cannot even achieve as high a classification accuracy as the most accurate individual classifying component. To address this issue, we present the strategy of Heuristic Weighted Voting, a technique that uses heuristics to determine the confidence that a classifier has in its predictions on an instance by instance basis. Using these heuristics to weight the votes in an ensemble res
APA, Harvard, Vancouver, ISO, and other styles
7

Silva, Renato Teixeira da [UNESP]. "Aplicação de meta-heurísticas na resolução do problema de balanceamento e designação de trabalhadores com deficiência em linha de produção." Universidade Estadual Paulista (UNESP), 2012. http://hdl.handle.net/11449/93081.

Full text
Abstract:
Made available in DSpace on 2014-06-11T19:26:18Z (GMT). No. of bitstreams: 0 Previous issue date: 2012-10-26Bitstream added on 2014-06-13T19:33:57Z : No. of bitstreams: 1 silva_rt_me_guara.pdf: 445223 bytes, checksum: f6563e16194940a8f4f8abc7c03ac033 (MD5)<br>Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)<br>A Organização Internacional do Trabalho estima que existem cerca de 650 milhões de pessoas com deficiência em idade produtiva. No entanto, esta parcela da população possui altos índices de desemprego devido a várias barreiras. Uma alternativa para facilitar a inclusã
APA, Harvard, Vancouver, ISO, and other styles
8

Silva, Renato Teixeira da. "Aplicação de meta-heurísticas na resolução do problema de balanceamento e designação de trabalhadores com deficiência em linha de produção /." Guaratinguetá : [s.n.], 2012. http://hdl.handle.net/11449/93081.

Full text
Abstract:
Orientador: Galeno José de Sena<br>Banca: Marcos Antonio Pereira<br>Banca: Anibal Tavares de Azevedo<br>Resumo: A Organização Internacional do Trabalho estima que existem cerca de 650 milhões de pessoas com deficiência em idade produtiva. No entanto, esta parcela da população possui altos índices de desemprego devido a várias barreiras. Uma alternativa para facilitar a inclusão dessas pessoas é a criação de Centros de Trabalho para pessoas com Deficiência (CTD's) onde as pessoas com deficiência tenham a oportunidade de experimentar um ambiente de trabalho real antes de irem para um emprego "no
APA, Harvard, Vancouver, ISO, and other styles
9

Hosny, Manar Ibrahim. "Investigating heuristic and meta-heuristic algorithms for solving pickup and delivery problems." Thesis, Cardiff University, 2010. http://orca.cf.ac.uk/55181/.

Full text
Abstract:
The development of effective decision support tools that can be adopted in the transportation industry is vital in the world we live in today, since it can lead to substantial cost reduction and efficient resource consumption. Solving the Vehicle Routing Problem (VRP) and its related variants is at the heart of scientific research for optimizing logistic planning. One important variant of the VRP is the Pickup and Delivery Problem (PDP). In the PDP, it is generally required to find one or more minimum cost routes to serve a number of customers, where two types of services may be performed at a
APA, Harvard, Vancouver, ISO, and other styles
10

Sanusi, Afeez Ayinla. "Train Dispatching: Heuristic Optimization." Thesis, Högskolan Dalarna, Datateknik, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:du-4107.

Full text
Abstract:
Train dispatchers faces lots of challenges due to conflicts which causes delays of trains as a result of solving possible dispatching problems the network faces. The major challenge is for the train dispatchers to make the right decision and have reliable, cost effective and much more faster approaches needed to solve dispatching problems. This thesis work provides detail information on the implementation of different heuristic algorithms for train dispatchers in solving train dispatching problems. The library data files used are in xml file format and deals with both single and double tracks
APA, Harvard, Vancouver, ISO, and other styles
11

Aslan, Burak Galip Püskülcü Halis. "Heuristic container placement algorithms/." [s.l.]: [s.n.], 2003. http://library.iyte.edu.tr/tezler/master/bilgisayaryazilimi/T000268.rar.

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

Henry, Obit Joe. "Developing novel meta-heuristic, hyper-heuristic and cooperative search for course timetabling problems." Thesis, University of Nottingham, 2010. http://eprints.nottingham.ac.uk/13581/.

Full text
Abstract:
The research presented in this PhD thesis focuses on the problem of university course timetabling, and examines the various ways in which metaheuristics, hyperheuristics and cooperative heuristic search techniques might be applied to this sort of problem. The university course timetabling problem is an NP-hard and also highly constrained combinatorial problem. Various techniques have been developed in the literature to tackle this problem. The research work presented in this thesis approaches this problem in two stages. For the first stage, the construction of initial solutions or timetables,
APA, Harvard, Vancouver, ISO, and other styles
13

Johnsson, Pontus. "Riskbedömning och beslutsfattande vid bränder : En utvärdering av verkliga scenarion utifrån ett heuristiskt perspektiv." Thesis, Linköping University, Department of Computer and Information Science, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-57152.

Full text
Abstract:
<p>I syfte att förbättra kunskapsläget kring människors beteenden vid bränder och utrymningar studerades fyra brandsituationer hämtade från ett flertal verkliga händelser ur ett beslutsfattande- och riskbedömningsperspektiv. Det teoretiska underlaget hämtades ur Kahnemans och Tverskys forskning kring heuristiker (Kahneman och Tversky, 1974; Kahneman, Slovic & Tversky, 1982; Gilovich, Griffin & Kahneman, 2002). För ändamålet användes tre heuristiska regler: tillgänglighet, representativitet och affekt. Dessa tre heuristiker möjliggör ögonblickssnabba riskbedömningar genom att allt utom en särsk
APA, Harvard, Vancouver, ISO, and other styles
14

Furcy, David Andre. "Speeding Up the Convergence of Online Heuristic Search and Scaling Up Offline Heuristic Search." Diss., Georgia Institute of Technology, 2004. http://hdl.handle.net/1853/4855.

Full text
Abstract:
The most popular methods for solving the shortest-path problem in Artificial Intelligence are heuristic search algorithms. The main contributions of this research are new heuristic search algorithms that are either faster or scale up to larger problems than existing algorithms. Our contributions apply to both online and offline tasks. For online tasks, existing real-time heuristic search algorithms learn better informed heuristic values and in some cases eventually converge to a shortest path by repeatedly executing the action leading to a successor state with a minimum cost-to-goal estimate.
APA, Harvard, Vancouver, ISO, and other styles
15

Jochumsson, Thorvaldur. "Heuristic multi-sequence search methods." Thesis, University of Skövde, Department of Computer Science, 2001. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-530.

Full text
Abstract:
<p>With increasing size of sequence databases heuristic search approaches have become necessary. Hidden Markov models are the best performing search methods known today with respect to discriminative power, but are too time complex to be practical when searching in large sequence databases. In this report, heuristic algorithms that reduce the search space before searching with traditional search algorithms of hidden Markov models are presented and experimentally validated. The results of the validation show that the heuristic search algorithms will speed up the searches without decreasing thei
APA, Harvard, Vancouver, ISO, and other styles
16

Choi, Hyun. "TOT: the association strength heuristic." Texas A&M University, 2005. http://hdl.handle.net/1969.1/2629.

Full text
Abstract:
Three experiments were conducted to examine the effect of association strength on TOT (tip-of-the-tongue states) and recall. Two hundred nineteen undergraduate students studied pictures and names of 24 imaginary animals that were presented on a large computer screen. The strength of association between the cue and target was manipulated by varying the number of times the picture and the name were presented simultaneously, while keeping the number of presentations for each picture or the target constant across conditions. After the study phase, participants were cued by each picture to recall t
APA, Harvard, Vancouver, ISO, and other styles
17

Yahaya, Abubakar. "Heuristic approaches to portfolio optimization." Thesis, Lancaster University, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.587501.

Full text
Abstract:
One of the most frequently studied areas in finance is the classical mean-variance portfolio selection model pioneered by Harry Markowitz; which is also, undoubtedly recognized as the foundation of modem portfolio theory. The model in its basic form deals with the selection of portfolio of assets such that a reasonable trade-off is achieved between the conflicting objectives. of maximum possible return at a minimum risk, given that the right choice of constituent assets is made and proper weights are allocated. However, despite its enormous contribution to this branch of knowledge, the model i
APA, Harvard, Vancouver, ISO, and other styles
18

Eldershaw, Craig. "Heuristic algorithms for motion planning." Thesis, University of Oxford, 2001. http://ora.ox.ac.uk/objects/uuid:ba8e63e9-58ae-4c7e-837f-08e471e858fb.

Full text
Abstract:
Motion planning is an increasingly important field of research. Factory automation is becoming more prevalent and at the same time, production runs are shortening in the name of customisation. With computer controlled equipment becoming cheaper and more modular, setting up near-fully automated production lines is becoming fast and easy. This means that the actual programming of the robots and assembly system is becoming the rate determining step. Automated motion planning is a possible solution to this—but only if it can run fast enough. Many heuristic planners have been created in an attempt
APA, Harvard, Vancouver, ISO, and other styles
19

Keuthen, Ralf. "Heuristic approaches for routing optimisation." Thesis, University of Nottingham, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.275960.

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

Garrett, Caelan Reed. "Heuristic search for manipulation planning." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/100596.

Full text
Abstract:
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from student-submitted PDF version of thesis.<br>Includes bibliographical references (pages 61-64).<br>Manipulation problems involving many objects present substantial challenges for planning algorithms due to the high dimensionality and multi-modality of the search space. Symbolic task planners can efficiently con
APA, Harvard, Vancouver, ISO, and other styles
21

Collether, John. "Portfolio optimization by heuristic algorithms." Thesis, University of Essex, 2014. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.635985.

Full text
Abstract:
Portfolio optimization is a major activity in business. It is intensively studied by researchers. Conventional portfolio optimization research made simplifying assumptions. For example, they assumed no constraint in how many assets one holds (cardinality constraint). They also assume no minimum and maximum holding sizes (holding size constraint). Once these assumptions are relaxed, conventional methods become inapplicable. New methods are demanded. Threshold Accepting is an established algorithm in the extended portfolio optimization problem.
APA, Harvard, Vancouver, ISO, and other styles
22

Vella, Alan. "Hyper-heuristic decision tree induction." Thesis, Heriot-Watt University, 2012. http://hdl.handle.net/10399/2540.

Full text
Abstract:
A hyper-heuristic is any algorithm that searches or operates in the space of heuristics as opposed to the space of solutions. Hyper-heuristics are increasingly used in function and combinatorial optimization. Rather than attempt to solve a problem using a fixed heuristic, a hyper-heuristic approach attempts to find a combination of heuristics that solve a problem (and in turn may be directly suitable for a class of problem instances). Hyper-heuristics have been little explored in data mining. This work presents novel hyper-heuristic approaches to data mining, by searching a space of attribute
APA, Harvard, Vancouver, ISO, and other styles
23

Li, Jian. "Ensemble clustering via heuristic optimisation." Thesis, Brunel University, 2010. http://bura.brunel.ac.uk/handle/2438/7510.

Full text
Abstract:
Traditional clustering algorithms have different criteria and biases, and there is no single algorithm that can be the best solution for a wide range of data sets. This problem often presents a significant obstacle to analysts in revealing meaningful information buried among the huge amount of data. Ensemble Clustering has been proposed as a way to avoid the biases and improve the accuracy of clustering. The difficulty in developing Ensemble Clustering methods is to combine external information (provided by input clusterings) with internal information (i.e. characteristics of given data) effec
APA, Harvard, Vancouver, ISO, and other styles
24

Stefanello, Fernando. "Heuristic approaches for network problems." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2015. http://hdl.handle.net/10183/134424.

Full text
Abstract:
Em nosso mundo altamente conectado, novas tecnologias provêm contínuas mudanças na velocidade e eficiência das redes de telecomunicações e de transporte. Muitas dessas tecnologias são originárias de pesquisas em problemas de otimização em redes aplicadas a diferentes áreas. Nesta tese, investigamos três problemas de otimização combinatória que podem ser abordados como estruturas de redes. Primeiramente, são abordados problemas de engenharia de tráfego em redes de transporte. O objetivo principal é investigar os efeitos de alterar o custo de um subconjunto de arcos da rede, considerando que os
APA, Harvard, Vancouver, ISO, and other styles
25

Chong, Yen N. "Heuristic algorithms for routing problems." Thesis, Curtin University, 2001. http://hdl.handle.net/20.500.11937/1090.

Full text
Abstract:
General routing problems deal with transporting some commodities and/or travelling along the axes of a given network in some optimal manner. In the modern world such problems arise in several contexts such as distribution of goods, transportation of commodities and/or people etc.In this thesis we focus on two classical routing problems, namely the Travelling Salesman Problem (TSP) and the Vehicle Routing Problem (VRP). The TSP can be described as a salesman travels from his home city, visits each of the other ( n - 1) cities exactly once and returns back to the home city such that the total di
APA, Harvard, Vancouver, ISO, and other styles
26

Chong, Yen N. "Heuristic algorithms for routing problems." Curtin University of Technology, School of Mathematics and Statistics, 2001. http://espace.library.curtin.edu.au:80/R/?func=dbin-jump-full&object_id=12855.

Full text
Abstract:
General routing problems deal with transporting some commodities and/or travelling along the axes of a given network in some optimal manner. In the modern world such problems arise in several contexts such as distribution of goods, transportation of commodities and/or people etc.In this thesis we focus on two classical routing problems, namely the Travelling Salesman Problem (TSP) and the Vehicle Routing Problem (VRP). The TSP can be described as a salesman travels from his home city, visits each of the other ( n - 1) cities exactly once and returns back to the home city such that the total di
APA, Harvard, Vancouver, ISO, and other styles
27

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
28

Méllo, Fábio Gavião Avelino de [UNESP]. "Método heurístico para criação de linhas de trabalho em problemas de escalonamento de pessoal." Universidade Estadual Paulista (UNESP), 2014. http://hdl.handle.net/11449/106401.

Full text
Abstract:
Made available in DSpace on 2014-06-11T19:35:40Z (GMT). No. of bitstreams: 0 Previous issue date: 2014-02-28Bitstream added on 2014-06-13T20:07:10Z : No. of bitstreams: 1 000757731.pdf: 2807037 bytes, checksum: 5aa196a9569db15583f96a6a1fbce2c8 (MD5)<br>A presente pesquisa trata do desenvolvimento de um método de solução do problema de construção de linhas de trabalho para a área de escalonamento de pessoal. Foram investigados diversos artigos da área de programação de pessoal com o objetivo de escolher precisamente o tema da pesquisa. Este tema escolhido foi o da construção de linhas de trab
APA, Harvard, Vancouver, ISO, and other styles
29

Méllo, Fábio Gavião Avelino de. "Método heurístico para criação de linhas de trabalho em problemas de escalonamento de pessoal /." Guaratinguetá, 2014. http://hdl.handle.net/11449/106401.

Full text
Abstract:
Orientador: Edson Luiz França Senne<br>Banca: Galeno José de Sena<br>Banca: José Roberto Dale Luche<br>Banca: Anibal Tavares de Azevedo<br>Banca: Kelly Cristina Poldi<br>Resumo : A presente pesquisa trata do desenvolvimento de um método de solução do problema de construção de linhas de trabalho para a área de escalonamento de pessoal. Foram investigados diversos artigos da área de programação de pessoal com o objetivo de escolher precisamente o tema da pesquisa. Este tema escolhido foi o da construção de linhas de trabalho para empresas de ônibus interurbanos no Brasil. De posse do tema escolh
APA, Harvard, Vancouver, ISO, and other styles
30

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
31

Mathirajan, M. "Heuristic Scheduling Algorithms For Parallel Heterogeneous Batch Processors." Thesis, Indian Institute of Science, 2000. https://etd.iisc.ac.in/handle/2005/196.

Full text
Abstract:
In the last decade, market pressures for greater variety of products forced a gradual shift from continuous manufacturing to batch manufacturing in various industries. Consequently batch scheduling problems have attracted the attention of researchers in production and operations management. This thesis addresses the scheduling of parallel non-identical batch processors in the presence of dynamic job arrivals, incompatible job-families and non-identical job sizes. This problem abstracts the scheduling of heat-treatment furnace operations of castings in a steel foundry. The problem is of cons
APA, Harvard, Vancouver, ISO, and other styles
32

Mathirajan, M. "Heuristic Scheduling Algorithms For Parallel Heterogeneous Batch Processors." Thesis, Indian Institute of Science, 2000. http://hdl.handle.net/2005/196.

Full text
Abstract:
In the last decade, market pressures for greater variety of products forced a gradual shift from continuous manufacturing to batch manufacturing in various industries. Consequently batch scheduling problems have attracted the attention of researchers in production and operations management. This thesis addresses the scheduling of parallel non-identical batch processors in the presence of dynamic job arrivals, incompatible job-families and non-identical job sizes. This problem abstracts the scheduling of heat-treatment furnace operations of castings in a steel foundry. The problem is of consid
APA, Harvard, Vancouver, ISO, and other styles
33

Aliano, Filho Angelo [UNESP]. "Metaheurísticas em um problema de rotação de culturas." Universidade Estadual Paulista (UNESP), 2012. http://hdl.handle.net/11449/95055.

Full text
Abstract:
Made available in DSpace on 2014-06-11T19:27:25Z (GMT). No. of bitstreams: 0 Previous issue date: 2012-03-06Bitstream added on 2014-06-13T19:35:31Z : No. of bitstreams: 1 alianofilho_a_me_botib.pdf: 803708 bytes, checksum: 7df8e5e731e86aee69b812455f899135 (MD5)<br>Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)<br>Um dos focos centrais na produção vegetal, discutidos ultimamente, e a utilização de medidas que visam um planejamento sustentável e ecológico, tendo em vista a degradação ambiental ocorrida nos ultimos anos. Por este motivo, a Rotação de Culturas tem ganhado de
APA, Harvard, Vancouver, ISO, and other styles
34

Aliano, Filho Angelo. "Metaheurísticas em um problema de rotação de culturas /." Botucatu, 2012. http://hdl.handle.net/11449/95055.

Full text
Abstract:
Orientador: Helenice de Oliveira Florentino Silva<br>Coorientador: Margarida Vaz Pato<br>Banca: Fernando Luiz Pio dos Santos<br>Banca: Silvio Alexandre Araújo<br>Resumo: Um dos focos centrais na produção vegetal, discutidos ultimamente, e a utilização de medidas que visam um planejamento sustentável e ecológico, tendo em vista a degradação ambiental ocorrida nos ultimos anos. Por este motivo, a Rotação de Culturas tem ganhado destaque na literatura, pois e um meio de produção cujos princípios práticos viabilizam uma agricultura ecológica e produtiva. Esta prática, uma vez bem conduzida pelos a
APA, Harvard, Vancouver, ISO, and other styles
35

Richards, Simon Kim. "Symbolic bidirectional breadth-first heuristic search." Master's thesis, Mississippi State : Mississippi State University, 2004. http://library.msstate.edu/etd/show.asp?etd=etd-08302004-085304.

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

Hodge, Bertram C. "A heuristic for land-attack predesignation." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1999. http://handle.dtic.mil/100.2/ADA374087.

Full text
Abstract:
Thesis (M.S. in Operations Research) Naval Postgraduate School, December 1999.<br>"December 1999". Thesis advisor(s): Alexandra M. Newman. Includes bibliographical references (p. 47). Also available online.
APA, Harvard, Vancouver, ISO, and other styles
37

Tian, Zhong Huan. "Gender based meta-heuristic optimization algorithms." Thesis, University of Macau, 2017. http://umaclib3.umac.mo/record=b3691331.

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

Asta, Shahriar. "Machine learning for improving heuristic optimisation." Thesis, University of Nottingham, 2015. http://eprints.nottingham.ac.uk/34216/.

Full text
Abstract:
Heuristics, metaheuristics and hyper-heuristics are search methodologies which have been preferred by many researchers and practitioners for solving computationally hard combinatorial optimisation problems, whenever the exact methods fail to produce high quality solutions in a reasonable amount of time. In this thesis, we introduce an advanced machine learning technique, namely, tensor analysis, into the field of heuristic optimisation. We show how the relevant data should be collected in tensorial form, analysed and used during the search process. Four case studies are presented to illustrate
APA, Harvard, Vancouver, ISO, and other styles
39

Cox, Donald Allan. "Supporting results synthesis in Heuristic Evaluation." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0020/MQ55279.pdf.

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

Liogys, Mindaugas. "Heuristic Algorithms for Nurse Rostering Problem." Doctoral thesis, Lithuanian Academic Libraries Network (LABT), 2013. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20130930_092436-21259.

Full text
Abstract:
In the dissertation the nurse rostering problem is investigated. The formulation of the problem is based on real-world data of one of the largest healthcare centers in Lithuania. Most recent publications that tackle the nurse rostering problem and the methods for solving the nurse rostering problem are reviewed, the mathematical formulation of the single objective and the multi-objective nurse rostering problem is presented, the requirements for the roster are described and a new method for solving the single objective and the multi-objective nurse rostering problem is proposed in this dissert
APA, Harvard, Vancouver, ISO, and other styles
41

Hassan, Atif Agha. "Information retrieval using advanced heuristic techniques." Thesis, University of Reading, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.515770.

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

Lewis, John N. "Expert systems development utilizing heuristic methods." Thesis, Monterey, California. Naval Postgraduate School, 1996. http://hdl.handle.net/10945/8376.

Full text
Abstract:
Approved for public release; distribution is unlimited.<br>This thesis analyzes the diagnostic domain and isolates the heuristics employed by experts to arrive at diagnostic solutions. These heuristic methods are then generalized in order to arrive at a series of heuristic rules that can be applied to a wide range of diagnostic processes independent of there respective domain. To test the validity of the generalized heuristics, a prototype expert system was created targeting the heuristics employed by avionics repair technicians in repair of the APS- 1 15 radar system on the P-3C Orion.
APA, Harvard, Vancouver, ISO, and other styles
43

El, Rhalibi Abdennour. "Hybrid heuristic techniques for rescheduling problems." Thesis, Liverpool John Moores University, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.431283.

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

Abdullah, Salwani. "Heuristic approaches for university timetabling problems." Thesis, University of Nottingham, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.428959.

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

Amir-Hussin, Amir A. B. "Heuristic methods for coalition structure generation." Thesis, Loughborough University, 2017. https://dspace.lboro.ac.uk/2134/26275.

Full text
Abstract:
The Coalition Structure Generation (CSG) problem requires finding an optimal partition of a set of n agents. An optimal partition means one that maximizes global welfare. Computing an optimal coalition structure is computationally hard especially when there are externalities, i.e., when the worth of a coalition is dependent on the organisation of agents outside the coalition. A number of algorithms were previously proposed to solve the CSG problem but most of these methods were designed for systems without externalities. Very little attention has been paid to finding optimal coalition structur
APA, Harvard, Vancouver, ISO, and other styles
46

Pellicane, Jacqueline Marie. "Medical Art Therapy: A Heuristic Exploration." Digital Commons at Loyola Marymount University and Loyola Law School, 2011. https://digitalcommons.lmu.edu/etd/88.

Full text
Abstract:
Medical art therapy is a specific type of art therapy practiced primarily in settings where clients are actively ill or in recovery from a medical procedure. This heuristic study will seek to support the advancement of growth in this field, a wide spread use of medical art therapy in every setting catering to the medically or chronically ill. The researcher used her own medical records from a 10-year bout with illness, childhood to late adolescence, to stimulate the production of data in the form of journal entries and artwork. The data collected was then analyzed through both a clinical and p
APA, Harvard, Vancouver, ISO, and other styles
47

Wang, Ning. "Model-Free Optimized Tracking Control Heuristic." Thesis, Université d'Ottawa / University of Ottawa, 2020. http://hdl.handle.net/10393/40911.

Full text
Abstract:
Tracking control algorithms often target the convergence of a tracking error. However, this can be at the expense of other important system characteristics, such as the control effort used to annihilate the tracking error, transient response, or steady-state characteristics, for example. Furthermore, most tracking control methods assume prior knowledge of the system dynamics, which is not always a realistic assumption, especially in the case of highly complex systems. In this thesis, a model-free optimized tracking control architectural heuristic is proposed. The suggested feedback system
APA, Harvard, Vancouver, ISO, and other styles
48

Chua, Eng Hong. "Determine network survivability using heuristic models." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2003. http://library.nps.navy.mil/uhtbin/hyperion-image/03Mar%5FChua%5FEngHong.pdf.

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

Holmes, Stephen Terry. "Heuristic generation of software test data." Thesis, University of South Wales, 1996. https://pure.southwales.ac.uk/en/studentthesis/heuristic-generation-of-software-test-data(aa20a88e-32a5-4958-9055-7abc11fbc541).html.

Full text
Abstract:
Incorrect system operation can, at worst, be life threatening or financially devastating. Software testing is a destructive process that aims to reveal software faults. Selection of good test data can be extremely difficult. To ease and assist test data selection, several test data generators have emerged that use a diverse range of approaches. Adaptive test data generators use existing test data to produce further effective test data. It has been observed that there is little empirical data on the adaptive approach. This thesis presents the Heuristically Aided Testing System (HATS), which is
APA, Harvard, Vancouver, ISO, and other styles
50

Clark, Calum. "Scheduling chemotherapy appointments : a heuristic approach." Thesis, University of Leeds, 2010. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.538443.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Heuristic' 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