31 |
Group theory and metaheuristics /Colletti, Bruce William, January 1999 (has links)
Thesis (Ph. D.)--University of Texas at Austin, 1999. / Vita. Includes bibliographical references (leaves 271-279). Available also in a digital version from Dissertation Abstracts.
|
32 |
The effect of heuristics on mathematical problem solvingWong, Man-on. January 1994 (has links)
Thesis (M.Ed.)--University of Hong Kong, 1994. / Includes bibliographical references (leaves 48-54). Also available in print.
|
33 |
Tabu search heuristics for the dynamic facility layout problemLiu, Wen-Hsing, January 2005 (has links)
Thesis (M.S.)--West Virginia University, 2005. / Title from document title page. Document formatted into pages; contains vii, 88 p. : ill. Includes abstract. Includes bibliographical references (p. 83-88).
|
34 |
The use of heuristics in identifying self-propagating malicious mobile codeTwardus, Jesse. January 2005 (has links)
Thesis (M.S.)--West Virginia University, 2005. / Title from document title page. Document formatted into pages; contains viii, 104 p. : ill. (some col.). Includes abstract. Includes bibliographical references (p. 89-92).
|
35 |
Influence of cost consciousness and heuristic approach on online search performanceAustin, Jill, January 1991 (has links)
Thesis (Ph. D.)--University of Western Ontario, 1991. / Vita. Includes bibliographical references (p. [191-196]).
|
36 |
An evaluative study of teacher creativity, use of the heuristic diagnostic teaching process and student mathematics performance /Whitelaw, Louise A. Reisman, Fredricka K. January 2007 (has links)
Thesis (Ph. D.)--Drexel University, 2007. / Includes abstract and vita. Includes bibliographical references (leaves 88-94).
|
37 |
Improving error discovery using guided model checking /Rungta, Neha S. January 2006 (has links) (PDF)
Thesis (M.S.)--Brigham Young University. Dept. of Computer Science, 2006. / Includes bibliographical references (p. 31-33).
|
38 |
Decision-making in sport an examination of the Take the First heuristic and self-efficacy theory /Hepler, Teri J. January 2008 (has links)
Thesis (Ph. D.)--Michigan State University. Kinesiology, 2008. / Title from PDF t.p. (Proquest, viewed on Aug. 17, 2009) Includes bibliographical references (p. 105-109).
|
39 |
Problema de reagrupamento capacitado / Redistricting capacitated problemAssis, Laura Silva de, 1983- 14 August 2018 (has links)
Orientador: Paulo Morelato França / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação / Made available in DSpace on 2018-08-14T08:51:37Z (GMT). No. of bitstreams: 1
Assis_LauraSilvade_M.pdf: 1632808 bytes, checksum: dfd28dc2bbd2bb5fe453a2fb1c2b7b6e (MD5)
Previous issue date: 2009 / Resumo: O objetivo desta dissertação é desenvolver uma metodologia eficiente para solucionar o problema de agrupamento capacitado multicritério (PACM), no qual objetos com pesos associados são dados, os quais devem ser particionados em agrupamentos com capacidade limitada. Neste trabalho, o PACM está ambientado em um problema de reagrupamento de lotes urbanos, nos quais devem ser realizadas as leituras dos medidores de energia elétrica por concessionárias de distribuição de energia. A operação de leitura dos medidores é realizada sobre lotes geograficamente definidos e é desempenhada sobre rotas percorridas uma vez por mês pelos leituristas. A motivação deste trabalho é atribuída ao fato de que, com o passar do tempo, o tamanho e o formato dos lotes vão ficando obsoletos, devido a modificações introduzidas na conformação atual, desarranjando o equilíbrio entre os lotes e desatualizando as rotas. Por esse motivo é importante realizar um reagrupamento dos lotes buscando a diminuição dos custos operacionais de leitura, assim como a minimização dos custos e transtornos causados pelas modificações. O método proposto para resolver o problema abordado nesta dissertação é um algoritmo baseado na metaheurística GRASP (Greedy randomized adaptive search procedure). A eficiência do método proposto é testada sobre uma série de instâncias geradas e sobre uma rede real. Os experimentos computacionais demonstram a eficiência do método. / Abstract: The aim of this dissertation is to develop an eficient methodology to solve the multicriteria redistricting capacitated problem (PACM), in which objects with associated weights are given, which must be partitioned into groups with limited capacity. In this work, the PACM is inserted in to a reassignment problem of urban clusters of clients, in which the readings of the eletric energy measurement must be performed by the company of energy distribution. The reading operation is performed over lots geographically defined is performed once a month by the readers. The motivation of this work is due to the fact that the size and shape of the lots become obsolete after some time, due to modifications introduced in the current conformation, desarranging the balance between the lots and outdating the routes. For this reason it is important to achieve a reassignment of the lots trying to decrease the operational costs of reading, as well as minimizing the costs and inconvenience caused by the changes. The proposed method to solve the problem addressed in this dissertation is a algorithm based on GRASP (Greedy randomized adaptive search procedure) metaheuristic. The efectiveness of the proposed method is tested on a large number of generated instances and on a real network. Computational experiments demonstrate the efectiveness of the proposed approach. / Mestrado / Automação / Mestre em Engenharia Elétrica
|
40 |
Heuristic Processing and Conspiracy EndorsementVaughen, William 12 August 2022 (has links)
No description available.
|
Page generated in 0.0156 seconds