Zaloguj się

Gotowe bibliografie tematyczne / Cuckoo Search and Genetic algorithm / Rozprawy doktorskie

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Cuckoo Search and Genetic algorithm.

Rozprawy doktorskie na temat „Cuckoo Search and Genetic algorithm”

Autor: Grafiati

Data publikacji: 3 czerwca 2025

Data aktualizacji: 31 lipca 2025

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Cuckoo Search and Genetic algorithm”.

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.

1

Lidberg, Simon. "Evolving Cuckoo Search : From single-objective to multi-objective." Thesis, Högskolan i Skövde, Institutionen för teknik och samhälle, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-5309.

Pełny tekst źródła

Streszczenie:

This thesis aims to produce a novel multi-objective algorithm that is based on Cuckoo Search by Dr. Xin-She Yang. Cuckoo Search is a promising nature-inspired meta-heuristic optimization algorithm, which currently is only able to solve single-objective optimization problems. After an introduction, a number of theoretical points are presented as a basis for the decision of which algorithms to hybridize Cuckoo Search with. These are then reviewed in detail and verified against current benchmark algorithms to evaluate their efficiency. To test the proposed algorithm in a new setting, a real-world

Style APA, Harvard, Vancouver, ISO itp.

2

Lakshminarayanan, Srinivasan. "Nature Inspired Discrete Integer Cuckoo Search Algorithm for Optimal Planned Generator Maintenance Scheduling." University of Toledo / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1438101954.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

Lin, Yu-Min. "Tabu Search and Genetic Algorithm for Phylogeny Inference." NCSU, 2008. http://www.lib.ncsu.edu/theses/available/etd-10092008-235130/.

Pełny tekst źródła

Streszczenie:

Phylogenetics is the study of evolutionary relations between different organisms. Phylogenetic trees are the representations of these relations. Researchers have been working on finding fast and systematic approaches to reconstruct phylogenetic trees from observed data for over 40 years. It has been shown that, given a certain criterion to evaluate each tree, finding the best fitted phylogenetic trees among all possible trees is an NP-hard problem. In this study, we focus on the topology searching techniques for the maximum-parsimony and maximum-likelihood phylogeny inference. We proposed two

Style APA, Harvard, Vancouver, ISO itp.

4

Al-Dallal, Ammar Sami. "Enhancing recall and precision of web search using genetic algorithm." Thesis, Brunel University, 2012. http://bura.brunel.ac.uk/handle/2438/7379.

Pełny tekst źródła

Streszczenie:

Due to rapid growth of the number of Web pages, web users encounter two main problems, namely: many of the retrieved documents are not related to the user query which is called low precision, and many of relevant documents have not been retrieved yet which is called low recall. Information Retrieval (IR) is an essential and useful technique for Web search; thus, different approaches and techniques are developed. Because of its parallel mechanism with high-dimensional space, Genetic Algorithm (GA) has been adopted to solve many of optimization problems where IR is one of them. This thesis propo

Style APA, Harvard, Vancouver, ISO itp.

5

Zhang, Xiaoyu. "Effective Search in Online Knowledge Communities: A Genetic Algorithm Approach." Thesis, Virginia Tech, 2009. http://hdl.handle.net/10919/35059.

Pełny tekst źródła

Streszczenie:

Online Knowledge Communities, also known as online forum, are popular web-based tools that allow members to seek and share knowledge. Documents to answer varieties of questions are associated with the process of knowledge exchange. The social network of members in an Online Knowledge Community is an important factor to improve search precision. However, prior ranking functions donâ t handle this kind of document with using this information. In this study, we try to resolve the problem of finding authoritative documents for a user query within an Online Knowledge Community. Unlike prior rankin

Style APA, Harvard, Vancouver, ISO itp.

6

Kong, Garry. "An Investigation of Complex Visual Search With The Genetic Algorithm." Thesis, The University of Sydney, 2016. http://hdl.handle.net/2123/16326.

Pełny tekst źródła

Streszczenie:

Visual search is an everyday task, defined as the search for a target amongst distractors. Visual search has historically been thought to reflect primarily early perceptual processes, with little influence of cognitive processes. However, recent research suggests that this is an artefact of the simple stimuli typically used in the field. In this thesis, I will use the genetic algorithm to study visual search for complex stimuli. In part 1, I use the genetic algorithm to investigate a display comprised of 119 distractors, each with an orientation, colour and size. Results suggest that distracto

Style APA, Harvard, Vancouver, ISO itp.

7

Yamashiro, Daisuke, Tomohiro Yoshikawa, and Takeshi Furuhashi. "Visualization of Search Process and Improvement of Search Performance in Multi-Objective Genetic Algorithm." IEEE, 2006. http://hdl.handle.net/2237/9486.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

Bilal, Mohd. "A Heuristic Search Algorithm for Asteroid Tour Missions." Thesis, Luleå tekniska universitet, Rymdteknik, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-71361.

Pełny tekst źródła

Streszczenie:

Since the discovery of Ceres, asteroids have been of immense scientific interest and intrigue. They hold answers to many of the fundamental questionsabout the formation and evolution of the Solar System. Therefore, a missionsurveying the asteroid belt with close encounter of carefully chosen asteroidswould be of immense scientific benefit. The trajectory of such an asteroidtour mission needs to be designed such that asteroids of a wide range ofcompositions and sizes are encountered; all with an extremely limited ∆Vbudget.This thesis presents a novel heuristic algorithm to optimize trajectories

Style APA, Harvard, Vancouver, ISO itp.

9

Nguyen, Quoc Tuan. "Using the genetic algorithm to optimize Web search: Lessons from biology." Thesis, University of Ottawa (Canada), 2006. http://hdl.handle.net/10393/27160.

Pełny tekst źródła

Streszczenie:

Searching for information on the Web is a relatively inefficient process. My goal is to develop a method that optimizes web search queries without user intervention. Developing intelligent ways to automate this process includes the development of algorithms that automatically manipulate the use of keywords to produce the desired output. Genetic algorithms (GA) provide a potentially useful approach in this area. However, these approaches have not fully exploited the biological concepts associated with genetic reproduction and evolution. I hypothesize that an approach that uses GA but modifies

Style APA, Harvard, Vancouver, ISO itp.

10

Harris, Richard Alan. "An analysis of the genetic algorithm and abstract search space visualisation." Thesis, University of Plymouth, 1996. http://hdl.handle.net/10026.1/2087.

Pełny tekst źródła

Streszczenie:

The Genetic Algorithm (Holland, 1975) is a powerful search technique based upon the principles of Darwinian evolution. In its simplest form the GA consists of three main operators - crossover, mutation and selection. The principal theoretical treatment of the Genetic Algorithm (GA) is provided by the Schema Theorem and building block hypothesis (Holland, 1975). The building block hypothesis describes the GA search process as the combination, sampling and recombination of fragments of solutions known as building blocks. The crossover operator is responsible for the combination of building block

Style APA, Harvard, Vancouver, ISO itp.

11

Rachakonda, Ravi Kanth. "Crew Rostering Problem: A Random Key Genetic Algorithm With Local Search." The Ohio State University, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=osu1230931714.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

12

Rachakonda, Ravi Kanth. "Crew rostering problem a random key genetic algorithm with local search /." Columbus, Ohio : Ohio State University, 2008. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1230931714.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

13

Boscoe-Wallace, Agnes. "Optimisation of speed camera locations using genetic algorithm and pattern search." Thesis, Loughborough University, 2017. https://dspace.lboro.ac.uk/2134/25179.

Pełny tekst źródła

Streszczenie:

Road traffic accidents continue to be a public health problem and are a global issue due to the huge financial burden they place on families and society as a whole. Speed has been identified as a major contributor to the severity of traffic accidents and there is the need for better speed management if road traffic accidents are to be reduced. Over the years various measures have been implemented to manage vehicle speeds. The use of speed cameras and vehicle activated signs in recent times has contributed to the reduction of vehicle speeds to various extents. Speed cameras use punitive measure

Style APA, Harvard, Vancouver, ISO itp.

14

Anisenia, Andrei. "Stochastic Search Genetic Algorithm Approximation of Input Signals in Native Neuronal Networks." Thèse, Université d'Ottawa / University of Ottawa, 2013. http://hdl.handle.net/10393/26220.

Pełny tekst źródła

Streszczenie:

The present work investigates the applicability of Genetic Algorithms (GA) to the problem of signal propagation in Native Neuronal Networks (NNNs). These networks are comprised of neurons, some of which receive input signals. The signals propagate though the network by transmission between neurons. The research focuses on the regeneration of the output signal of the network without knowing the original input signal. The computational complexity of the problem is prohibitive for the exact computation. We propose to use a heuristic approach called Genetic Algorithm. Three algorithms are develope

Style APA, Harvard, Vancouver, ISO itp.

15

Lianjie, Shen. "Optimization and Search in Model-Based Automotive SW/HW Development." Thesis, Linköpings universitet, Programvara och system, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-105394.

Pełny tekst źródła

Streszczenie:

In this thesis two case studies are performed about solving two design problems we face during the design phase of new Volvo truck. One is to solve the frame packing problem on CAN bus. The other is to solve the LDC allocation problem. Both solutions are targeted to meet as many end-to-end latency requirements as possible. Now the solution is obtained through manually approach and based on the designer experience. But it is still not satisfactory enough. With the development of artificial intelligence method we propose two methods based on genetic algorithm to solve our design problem we face

Style APA, Harvard, Vancouver, ISO itp.

16

Bengtlars, Ann, and Erik Väljamets. "Optimization of Pile Groups : A practical study using Genetic Algorithm and Direct Search with four different objective functions." Thesis, KTH, Bro- och stålbyggnad, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-146832.

Pełny tekst źródła

Streszczenie:

Piling is expensive but often necessary when building large structures, for example bridges. Some pile types, such as steel core piles, are very costly and it is therefore of great interest to keep the number piles in a pile group to a minimum. This thesis deals with optimization of pile groups with respect to placement, batter and angle of rotation in order to minimize the number of piles. A program has been developed, where two optimization algorithms named Genetic Algorithm and Direct Search, and four objective functions have been used. These have been tested and compared to find the most s

Style APA, Harvard, Vancouver, ISO itp.

17

Kovàcs, Akos. "Solving the Vehicle Routing Problem with Genetic ALgorithm and Simulated Annealing." Thesis, Högskolan Dalarna, Datateknik, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:du-3306.

Pełny tekst źródła

Streszczenie:

This Thesis Work will concentrate on a very interesting problem, the Vehicle Routing Problem (VRP). In this problem, customers or cities have to be visited and packages have to be transported to each of them, starting from a basis point on the map. The goal is to solve the transportation problem, to be able to deliver the packages-on time for the customers,-enough package for each Customer,-using the available resources- and – of course - to be so effective as it is possible.Although this problem seems to be very easy to solve with a small number of cities or customers, it is not. In this pro

Style APA, Harvard, Vancouver, ISO itp.

18

Forsberg, Mikael. "Local search hybridization of a genetic algorithm for solving the University Course Timetabling Problem." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-229677.

Pełny tekst źródła

Streszczenie:

The University Course Timetabling Problem (UCTP) is the problem of assigning locations (lecture halls, computer rooms) and time slots (time and date) to a set of events (lectures, labs) while satisfying a number of constraints such as avoiding double-bookings. Many variants of problem formulations exist, and most realistic variants are thought to be NP-hard. A recent trend in solving hard scheduling problems lies in the application of hybrid metaheuristics, where improvements are often found by hybridizing a population-based approach with some form of local search. In this paper, an implementa

Style APA, Harvard, Vancouver, ISO itp.

19

Fernando, Pradeep R. "Genetic algorithm based two-dimensional and three-dimensional floorplanning for VLSI ASICs." [Tampa, Fla] : University of South Florida, 2006. http://purl.fcla.edu/usf/dc/et/SFE0001549.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

20

Hassan, Fadratul Hafinaz. "Heuristic search methods and cellular automata modelling for layout design." Thesis, Brunel University, 2013. http://bura.brunel.ac.uk/handle/2438/7581.

Pełny tekst źródła

Streszczenie:

Spatial layout design must consider not only ease of movement for pedestrians under normal conditions, but also their safety in panic situations, such as an emergency evacuation in a theatre, stadium or hospital. Using pedestrian simulation statistics, the movement of crowds can be used to study the consequences of different spatial layouts. Previous works either create an optimal spatial arrangement or an optimal pedestrian circulation. They do not automatically optimise both problems simultaneously. Thus, the idea behind the research in this thesis is to achieve a vital architectural design

Style APA, Harvard, Vancouver, ISO itp.

21

Rizvanoglu, Emre. "Intelligent Search And Algorithms For Optimal Assignment Of Air Force Resources In Operations." Master's thesis, METU, 2008. http://etd.lib.metu.edu.tr/upload/3/12610154/index.pdf.

Pełny tekst źródła

Streszczenie:

The growing extent and variety of present military operations forces to use the resources in hand at its best. Especially, the optimum usage and assignment of limited number of the air force resources to missions will provide a considerable advantage in the battle field. The problem of finding the feasible and optimum assignment has been known to be studied<br>yet performing the process faster is still a topic that captures researchers&rsquo<br>attention because of the computational complexity that the assignment problem involves within. In this thesis, exploring the optimal assignment of flee

Style APA, Harvard, Vancouver, ISO itp.

22

Renman, Casper, and Hampus Fristedt. "A comparative analysis of a Tabu Search and a Genetic Algorithm for solving a University Course Timetabling Problem." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-166276.

Pełny tekst źródła

Streszczenie:

This work implements a Tabu search (TS) algorithm for solving an instance of the University Course Timetabling Problem (UCTP). The algorithm is com- pared to a Genetic algorithm (GA) implemented by Yamazaki and Pertoft (2014) that solves the same instance. The purpose of the work is to explore how the approaches dier for this particular instance, and specifically inves- tigate whether a TS algorithm alone is sucient, considering the small size of the UCTP instance. The TS was based on the OpenTS library (Harder, 2001) and reuses parts from Yamazaki and Pertoft’s (2014) GA. The results show tha

Style APA, Harvard, Vancouver, ISO itp.

23

Classon, Johan, and Viktor Andersson. "Procedural Generation of Levels with Controllable Difficulty for a Platform Game Using a Genetic Algorithm." Thesis, Linköpings universitet, Interaktiva och kognitiva system, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-129801.

Pełny tekst źródła

Streszczenie:

This thesis describes the implementation and evaluation of a genetic algorithm (GA) for procedurally generating levels with controllable difficulty for a motion-based 2D platform game. Manually creating content can be time-consuming, and it may be desirable to automate this process with an algorithm, using Procedural Content Generation (PCG). An algorithm was implemented and then refined with an iterative method by conducting user tests. The resulting algorithm is considered a success and shows that using GA's for this kind of PCG is viable. An algorithm able to control difficulty of its outpu

Style APA, Harvard, Vancouver, ISO itp.

24

Woodside-Oriakhi, Maria. "Portfolio optimisation with transaction cost." Thesis, Brunel University, 2011. http://bura.brunel.ac.uk/handle/2438/5839.

Pełny tekst źródła

Streszczenie:

Portfolio selection is an example of decision making under conditions of uncertainty. In the face of an unknown future, fund managers make complex financial choices based on the investors perceptions and preferences towards risk and return. Since the seminal work of Markowitz, many studies have been published using his mean-variance (MV) model as a basis. These mathematical models of investor attitudes and asset return dynamics aid in the portfolio selection process. In this thesis we extend the MV model to include the cardinality constraints which limit the number of assets held in the portfo

Style APA, Harvard, Vancouver, ISO itp.

25

Frithiof, Fredrik. "A framework for designing a modular muffler system by global optimization." Thesis, KTH, Optimeringslära och systemteori, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-169650.

Pełny tekst źródła

Streszczenie:

When creating a muffler to be installed on a noise generating machine, the design parameters as well as the placements of sound attenuating elements has to be optimized in order to minimize the sound coming out of the equipage. This is exemplified in a small project task for students of a basic course in optimization at KTH. The task is however flawed, since both the way in which the optimization problem is formed is overly simplistic and the algorithm used to solve the problem, fmincon, does not cope well with the mathematical complexity of the model, meaning it gets stuck in a local optimum

Style APA, Harvard, Vancouver, ISO itp.

26

Duncan, Kayleigh E. "Islands of Fitness Compact Genetic Algorithm for Rapid In-Flight Control Learning in a Flapping-Wing Micro Air Vehicle: A Search Space Reduction Approach." Wright State University / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=wright1578065644405701.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

27

El, Mourabit Samir. "Optimization of Concrete Beam Bridges : Development of Software for Design Automation and Cost Optimization." Thesis, KTH, Bro- och stålbyggnad, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-189273.

Pełny tekst źródła

Streszczenie:

Recent advances in the field of computational intelligence have led to a numberof promising optimization algorithms. These algorithms have the potential to findoptimal or near-optimal solutions to complex problems within a reasonable timeframe. Structural optimization is a research field where such algorithms are appliedto optimally design structures. Although a significant amount of research has been published in the field ofstructural optimization since the 1960s, little of the research effort has been utilizedin structural design practice. One reason for this is that only a small portion of

Style APA, Harvard, Vancouver, ISO itp.

28

KUMAR, NEERAJ. "DESIGNING OF MARKET MODEL, EFFECTIVE PRICE FORECASTING TOOL AND BIDDING STRATEGY FOR INDIAN ELECTRICITY MARKET." Thesis, DELHI TECHNOLOGICAL UNIVERSITY, 2021. http://dspace.dtu.ac.in:8080/jspui/handle/repository/18910.

Pełny tekst źródła

Streszczenie:

The Development scenario for renewable energy across the globe is changing rapidly in terms of capacity addition and grid interconnection. Penetration of renewable energy resources into grid is necessary to meet the elevated demand of electricity. In view of this penetration of solar and wind power growing enormously across the globe. Solar energy is widely escalating in terms of generation and capacity addition due its better predictability over wind energy. Electricity pricing is one of the important aspects for power system planning and it felicitates information for the electricity b

Style APA, Harvard, Vancouver, ISO itp.

29

Kovaliovas, Viktoras. "Genomų palyginimo algoritmų tyrimas." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2005. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2005~D_20050523_134443-96340.

Pełny tekst źródła

Streszczenie:

To understand evolution, and to discover how different species are related, gene order analysis is a useful tool. Problems in this area can usually be formulated in a combinatorial language. We regard genomes as signed, or unsigned permutations, and thus evolutionary operations like inversions (reversing the order of a segment of genes) are easy to describe combinatorially. A commonly studied problem is to determine the evolutionary distance between two species. This is estimated by several combinatorial distances between gene order permutations, for instance the inversion distance. The main o

Style APA, Harvard, Vancouver, ISO itp.

30

Ahern, Zeke Alexander. "Exact and approximate optimisation for strategic bus network planning." Thesis, Queensland University of Technology, 2020. https://eprints.qut.edu.au/206458/1/Zeke_Ahern_Thesis.pdf.

Pełny tekst źródła

Streszczenie:

This thesis contributes to the area of transportation network design at the strategic level, considering objectives for the passenger and operator. The main goal of the research is to improve the existing methods by developing new and more rigorous approaches to integrating route choice, service frequency and adequately accounting for passenger waiting time. An exact model was developed: providing a concise non-ambiguous description to the problem. Case study problem instances found that exact methods implemented by commercial solvers are not scalable for practical problems. Therefore, meta-he

Style APA, Harvard, Vancouver, ISO itp.

31

Esswein, Lance C. "Genetic algorithm design and testing of a random element 3-D 2.4 GHZ phased array transmit antenna constructed of commercial RF microchips." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2003. http://library.nps.navy.mil/uhtbin/hyperion-image/03Jun%5FEsswein.pdf.

Pełny tekst źródła

Streszczenie:

Thesis (M.S. in Physics)--Naval Postgraduate School, June 2003.<br>Thesis advisor(s): Michael Melich, David Jenn, Rodney Johnson. Includes bibliographical references (p. 113-115). Also available online.

Style APA, Harvard, Vancouver, ISO itp.

32

Deng, Qichen. "Antenna Optimization in Long-Term Evolution Networks." Thesis, KTH, Optimeringslära och systemteori, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-119147.

Pełny tekst źródła

Streszczenie:

The aim of this master thesis is to study algorithms for automatically tuning antenna parameters to improve the performance of the radio access part of a telecommunication network and user experience. There are four dierent optimization algorithms, Stepwise Minimization Algorithm, Random Search Algorithm, Modied Steepest Descent Algorithm and Multi-Objective Genetic Algorithm to be applied to a model of a radio access network. The performances of all algorithms will be evaluated in this thesis. Moreover, a graphical user interface which is developed to facilitate the antenna tuning simulations

Style APA, Harvard, Vancouver, ISO itp.

33

Seevers, K. Daniel. "SUSTAINABLE LIFETIME VALUE CREATION THROUGH INNOVATIVE PRODUCT DESIGN: A PRODUCT ASSURANCE MODEL." UKnowledge, 2014. http://uknowledge.uky.edu/me_etds/42.

Pełny tekst źródła

Streszczenie:

In the field of product development, many organizations struggle to create a value proposition that can overcome the headwinds of technology change, regulatory requirements, and intense competition, in an effort to satisfy the long-term goals of sustainability. Today, organizations are realizing that they have lost portfolio value due to poor reliability, early product retirement, and abandoned design platforms. Beyond Lean and Green Manufacturing, shareholder value can be enhanced by taking a broader perspective, and integrating sustainability innovation elements into product designs in order

Style APA, Harvard, Vancouver, ISO itp.

34

Kopřiva, Jan. "Srovnání algoritmů při řešení problému obchodního cestujícího." Master's thesis, Vysoké učení technické v Brně. Fakulta podnikatelská, 2009. http://www.nusl.cz/ntk/nusl-222126.

Pełny tekst źródła

Streszczenie:

The Master Thesis deals with logistic module innovation of information system ERP. The principle of innovation is based on implementation of heuristic algorithms which solve Travel Salesman Problems (TSP). The software MATLAB is used for analysis and tests of these algorithms. The goal of Master Thesis is the comparison of selections algorithm, which are suitable for economic purposes (accuracy of solution, speed of calculation and memory demands).

Style APA, Harvard, Vancouver, ISO itp.

35

Jacmenovic, Dennis, and dennis_jacman@yahoo com au. "Optimisation of Active Microstrip Patch Antennas." RMIT University. Electrical and Computer Engineering, 2004. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20060307.144507.

Pełny tekst źródła

Streszczenie:

This thesis presents a study of impedance optimisation of active microstrip patch antennas to multiple frequency points. A single layered aperture coupled microstrip patch antenna has been optimised to match the source reflection coefficient of a transistor in designing an active antenna. The active aperture coupled microstrip patch antenna was optimised to satisfy Global Positioning System (GPS) frequency specifications. A rudimentary aperture coupled microstrip patch antenna consists of a rectangular antenna element etched on the top surface of two dielectric substrates. The substrates

Style APA, Harvard, Vancouver, ISO itp.

36

Weissheimer, Júnior Carlos Alfredo. "Desenvolvimento de um algoritmo híbrido utilizando metaheurísticas aplicado a uma plataforma Internet Protocol Television – IPTV." Universidade do Vale do Rio dos Sinos, 2012. http://www.repositorio.jesuita.org.br/handle/UNISINOS/4747.

Pełny tekst źródła

Streszczenie:

Submitted by Fabricia Fialho Reginato (fabriciar) on 2015-08-26T00:27:58Z No. of bitstreams: 1 CarlosWEISSHEIMER.pdf: 1780174 bytes, checksum: 5713fcfb8f07d336d4ef9416f67e4735 (MD5)<br>Made available in DSpace on 2015-08-26T00:27:58Z (GMT). No. of bitstreams: 1 CarlosWEISSHEIMER.pdf: 1780174 bytes, checksum: 5713fcfb8f07d336d4ef9416f67e4735 (MD5) Previous issue date: 2012<br>FINEP - Financiadora de Estudos e Projetos<br>A tecnologia Internet Protocol Television (IPTV) é um fator impactante na sociedade. Ela tem sido explorada por diferentes meios de transmissão para a entrega de conteúdo

Style APA, Harvard, Vancouver, ISO itp.

37

Appel, Martin. "Využití optimalizačních metod pro odhad parametrů simulačních modelů." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2016. http://www.nusl.cz/ntk/nusl-254435.

Pełny tekst źródła

Streszczenie:

This thesis deals with parameters estimation search problematics. Newly-made software is proposed within a frame of this work and it replaces and supplements the Parameter Estimation tool, which is a part of Matlab toolbox. New software proposes suitable visualisation and new functions, which may lead to better solutions than build-in tools in Matlab.

Style APA, Harvard, Vancouver, ISO itp.

38

Besbes, Mariem. "Modélisation et résolution du problème d’implantation des ateliers de production : proposition d’une approche combinée Algorithme Génétique – Algorithme A*." Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLC094.

Pełny tekst źródła

Streszczenie:

Pour faire face à la concurrence, les entreprises cherchent à améliorer leurs performances industrielles. L’une des solutions à ce défi réside dans la détermination de la meilleure configuration des ateliers de production. Ce type de problème est connu en anglais par Facility Layout Problem « FLP». Dans ce contexte, notre travail propose une méthodologie pour la définition de la configuration d’atelier à travers une approche réaliste. Plus précisément, notre objectif est de prendre en compte les distances réelles parcourues par les pièces dans l’atelier et des contraintes liées au système qui

Style APA, Harvard, Vancouver, ISO itp.

39

Gomes, Wagner de Paula. "Programação de tripulantes de aeronaves no contexto brasileiro." Universidade de São Paulo, 2009. http://www.teses.usp.br/teses/disponiveis/3/3138/tde-21122009-170008/.

Pełny tekst źródła

Streszczenie:

Esta pesquisa trata o Problema de Programação de Tripulantes (PPT), presente no planejamento operacional das empresas aéreas. O principal objetivo do PPT é atribuir um conjunto de tarefas aos tripulantes, considerando as regulamentações trabalhistas, as regras de segurança e as políticas das empresas, de tal maneira que o custo da tripulação seja mínimo. O PPT é normalmente dividido em dois subproblemas, resolvidos sequencialmente: Problema de Determinação das Viagens (PDV) e Problema de Atribuição de Escalas (PAE). No PDV, determina-se um conjunto de viagens que cubra todos os voos planejados

Style APA, Harvard, Vancouver, ISO itp.

40

Ta, Quang-Chieu. "Matheuristic algorithms for minimizing total tardiness in flow shop scheduling problems." Thesis, Tours, 2015. http://www.theses.fr/2015TOUR4002/document.

Pełny tekst źródła

Streszczenie:

Nous considérons dans cette thèse un problème d’ordonnancement de flow-shop de permutation où un ensemble de travaux doit être ordonnancé sur un ensemble de machines. Les travaux doivent être ordonnancés sur les machines dans le même ordre. L’objectif est de minimiser le retard total. Nous proposons des algorithmes heuristiques et des nouvelles matheuristiques pour ce problème. Les matheuristiques sont un nouveau type d’algorithmes approchés qui ont été proposés pour résoudre des problèmes d’optimisation combinatoire. Les méthodes importent de la résolution exacte au sein des approches (méta)

Style APA, Harvard, Vancouver, ISO itp.

41

Dhein, Guilherme. "Problemas de roteamento de veículos com dependência temporal e espacial entre rotas de equipes de campo." Universidade Federal de Santa Maria, 2016. http://repositorio.ufsm.br/handle/1/3700.

Pełny tekst źródła

Streszczenie:

This thesis presents two new routing problems, both with objective functions focused on relative positioning of teams during the routing horizon. The relative positioning results in temporal and spatial dependencies among routes and is quantified with a nonlinear dispersion metric, designed to evaluate the instantaneous distances among teams over a time interval. This metric allows the design of objective functions to approximate teams during routes execution, when minimized, or disperse them, when maximized. Both approximation and dispersion are important routing characteristics in some pract

Style APA, Harvard, Vancouver, ISO itp.

42

Solat, Yavari Majid. "Slab Frame Bridges : Structural Optimization Considering Investment Cost and Environmental Impacts." Licentiate thesis, KTH, Bro- och stålbyggnad, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-202948.

Pełny tekst źródła

Streszczenie:

This research encompasses the automated design and structural optimization of reinforced concrete slab frame bridges, considering investment costs and environmental impacts. The most important feature of this work is that it focusses on realistic and complete models of slab frame bridges rather than on optimization of only individual members or sections of a bridge. The thesis consists of an extended summary of publications and three appended papers. In the first paper, using simple assumptions, the possibility of applying cost-optimization to the structural design of slab frame bridges was in

Style APA, Harvard, Vancouver, ISO itp.

43

He, Jeannie. "Automatic Diagnosis of Parkinson’s Disease Using Machine Learning : A Comparative Study of Different Feature Selection Algorithms, Classifiers and Sampling Methods." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-301616.

Pełny tekst źródła

Streszczenie:

Over the past few years, several studies have been published to propose algorithms for the automated diagnosis of Parkinson’s Disease using simple exams such as drawing and voice exams. However, at the same time as all classifiers appear to have been outperformed by another classifier in at least one study, there appear to lack a study on how well different classifiers work with a certain feature selection algorithm and sampling method. More importantly, there appear to lack a study that compares the proposed feature selection algorithm and/or sampling method with a baseline that does not invo

Style APA, Harvard, Vancouver, ISO itp.

44

Linck, Iris Correa das Chagas. "Um sistema de codificação de vídeo para TV digital – SBTVD." Universidade do Vale do Rio dos Sinos, 2012. http://www.repositorio.jesuita.org.br/handle/UNISINOS/4206.

Pełny tekst źródła

Streszczenie:

Submitted by Silvana Teresinha Dornelles Studzinski (sstudzinski) on 2015-07-03T17:52:39Z No. of bitstreams: 1 Iris Corrêa das Chagas Linck.pdf: 1456080 bytes, checksum: ea4a6f659a229e845649c58baaf8cb23 (MD5)<br>Made available in DSpace on 2015-07-03T17:52:39Z (GMT). No. of bitstreams: 1 Iris Corrêa das Chagas Linck.pdf: 1456080 bytes, checksum: ea4a6f659a229e845649c58baaf8cb23 (MD5) Previous issue date: 2012<br>FINEP - Financiadora de Estudos e Projetos<br>Neste trabalho é desenvolvido um algoritmo híbrido que simula o comportamento do Codificador/Decodificador de vídeo H.264/AVC, ou si

Style APA, Harvard, Vancouver, ISO itp.

45

Galafassi, Cristiano. "Aplicação de metaheurísticas na abordagem do problema de roteamento de veículos capacitado com janelas de tempo." Universidade do Vale do Rio dos Sinos, 2011. http://www.repositorio.jesuita.org.br/handle/UNISINOS/3229.

Pełny tekst źródła

Streszczenie:

Submitted by CARLA MARIA GOULART DE MORAES (carlagm) on 2015-04-01T18:43:13Z No. of bitstreams: 1 CristianoGalafassi.pdf: 2977122 bytes, checksum: 5d851dbaf2aea5f9599c6ce44fa55ba0 (MD5)<br>Made available in DSpace on 2015-04-01T18:43:13Z (GMT). No. of bitstreams: 1 CristianoGalafassi.pdf: 2977122 bytes, checksum: 5d851dbaf2aea5f9599c6ce44fa55ba0 (MD5) Previous issue date: 2011<br>CNPQ – Conselho Nacional de Desenvolvimento Científico e Tecnológico<br>Este trabalho aborda o Problema de Roteamento de Veículos Capacitado com Janelas de Tempo, onde devem ser atendidas as restrições de capaci

Style APA, Harvard, Vancouver, ISO itp.

46

Simões, Wagner Lourenzi. "Abordagem metaheurística híbrida para a otimização de sequenciamento de produção em Flow Shop Permutacional com tempos de setup dependentes da sequência." Universidade do Vale do Rio dos Sinos, 2016. http://www.repositorio.jesuita.org.br/handle/UNISINOS/6022.

Pełny tekst źródła

Streszczenie:

Submitted by Silvana Teresinha Dornelles Studzinski (sstudzinski) on 2017-02-08T15:41:51Z No. of bitstreams: 1 Wagner Lourenzi Simões_.pdf: 1389162 bytes, checksum: 302aec842d2f4e8b0a7c78ecbae24357 (MD5)<br>Made available in DSpace on 2017-02-08T15:41:51Z (GMT). No. of bitstreams: 1 Wagner Lourenzi Simões_.pdf: 1389162 bytes, checksum: 302aec842d2f4e8b0a7c78ecbae24357 (MD5) Previous issue date: 2016-12-06<br>CAPES - Coordenação de Aperfeiçoamento de Pessoal de Nível Superior<br>Neste estudo, foi desenvolvida uma ferramenta computacional baseada em metaheurísticas para a otimização do seq

Style APA, Harvard, Vancouver, ISO itp.

47

Clark, 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ła

Streszczenie:

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

Style APA, Harvard, Vancouver, ISO itp.

48

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

Pełny tekst źródła

Streszczenie:

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

Style APA, Harvard, Vancouver, ISO itp.

49

Coelho, Neto Agnelo. "Análise da Confiabilidade em Redes de Distribuição Radiais: Reconfiguração e Alocação de Geração Distribuída." Universidade Federal do Maranhão, 2006. http://tedebc.ufma.br:8080/jspui/handle/tede/342.

Pełny tekst źródła

Streszczenie:

Made available in DSpace on 2016-08-17T14:52:50Z (GMT). No. of bitstreams: 1 AgneloCoelho.pdf: 1955217 bytes, checksum: bdaabbadfbcefa2a1d4e8f8926759c45 (MD5) Previous issue date: 2006-03-10<br>The distribution utilities must satisfy two concurrent objectives during planning process of the electric network: minimization of the investment cost and the satisfaction of reliability targets. An alternative to satisfy these objectives is to include low cost alternatives in the planning process. One of these alternatives is the reconfiguration of the distribution network. The reconfiguration of t

Style APA, Harvard, Vancouver, ISO itp.

50

Nguyen, Khac Duy. "Structural damage identification using experimental modal parameters via correlation approach." Thesis, Queensland University of Technology, 2018. https://eprints.qut.edu.au/117289/2/Khac%20Duy%20Nguyen.pdf.

Pełny tekst źródła

Streszczenie:

This research provides a new damage identification strategy using experimental modal parameters via correlation approach. Two damage identification algorithms using modal strain energy-eigenvalue ratio (MSEE) are presented. Firstly, a method using a simplified term of MSEE called geometric modal strain energy-eigenvalue ratio (GMSEE) is developed. Secondly, the original method is modified using the full term of MSEE, proving better capability of damage identification when used with fewer vibration modes. Performance of the proposed damage identification algorithms has been successfully validat

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!