Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 21 for “"Algorithms, Heuristic"”.

  1. Euristiniai algoritmai NP-pilniems uždaviniams spręsti ir jų realizacija GRIDui /

    … main goal of this work is to implement and test heuristic algorithms for GRID computing network to solve NP-complete problems. The problems of NP-complete set are not solved in polynomial time. To solve such problems, researchers have to use heuristic algorithms. Heuristic algorithms always give …

    vilnius Repository record for Euristiniai algoritmai NP-pilniems uždaviniams spręsti ir jų realizacija GRIDui / (opens in a new tab)

  2. Experiential Analysis of Heuristic Search Algorithms

    … part of useful and responsive computer systems. Algorithms responsible for this task are called search algorithms. Heuristic search techniques are an important subset of the search algorithms because of the minimum amount of time they need to find a solution. Their one drawback is the fact that …

    sdstate Repository record for Experiential Analysis of Heuristic Search Algorithms (opens in a new tab)

  3. Optimization of Tapered Composite Beams

    … both coded in MATLAB. Five optimization algorithms, heuristic and deterministic, are coded and compared and the most efficient method is selected. Because the ply orientation angles can assume an infinite number of possible angles, or follow the regular 0 / ±45 / 90 degrees approach, four …

    concordia Download PDF for Optimization of Tapered Composite Beams (opens in a new tab)

  4. Computational Intelligence for Analysis Concerning Financial Modelling and the Adaptive Market Hypothesis

    … endeavours to model complex systems with heuristic algorithms. Heuristic algorithms from CI are generally nature or biologically inspired programs that iteratively learn from experience. More specifically, the research focuses on the overlap between the fields of CI and financial analysis, …

    whiterose Download PDF for Computational Intelligence for Analysis Concerning Financial Modelling and the Adaptive Market Hypothesis (opens in a new tab)

  5. Μελέτη και μοντελοποίηση διπλών εκλειπτικών συστημάτων αστέρων τύπου W UMa

    … Levenberg-Marquardt, Downhill Simplex, Genetic Algorithms,Heuristic Scanning, Bootstrap resampling, Metropolis –Hasting Markov Chain MonteCarlo), their implementation to programs developed as part of the present thesis and their application to real data. These also represent the methodology of …

    greece Repository record for Μελέτη και μοντελοποίηση διπλών εκλειπτικών συστημάτων αστέρων τύπου W UMa (opens in a new tab)

  6. Μαθηματικά πρότυπα και αλγόριθμοι για προβλήματα εφοδιαστικής διαχείρισης: η περίπτωση των επικίνδυνων φορτίων

    Η µεταφορά επικίνδυνων φορτίων αποτελεί µία από τις πιο σηµαντικές οικονοµικές δραστηριότητες των βιοµηχανικά ανεπτυγµένων κρατών. Το κόστος µεταφοράς και οι σφοδρές εν δυνάµει επιπτώσεις ενός ατυχήµατος επικίνδυνων φορτίων προσδίδουν στο πρόβληµα δροµολόγησης των επικίνδυνων φορτίων ιδιαίτερη …

    greece Repository record for Μαθηματικά πρότυπα και αλγόριθμοι για προβλήματα εφοδιαστικής διαχείρισης: η περίπτωση των επικίνδυνων φορτίων (opens in a new tab)

  7. Hledání nejkratších cest grafem

    Předmětem této bakalářské práce je hledání, porovnání, úprava a implementace vhodných grafových algoritmů vedoucích k nalezení všech nejkratších cest mezi všemi dvojicemi vrcholů v neorientovaných grafech. Pro tento účel jsou využity modifikace již existujících algoritmů a jejich fragmentů tak, aby …

    brno-tech Repository record for Hledání nejkratších cest grafem (opens in a new tab)

  8. Inter-route optimization procedures for the dial-a-ride problem in Paratransit.

    … be also satisfied. Since the DARPTW is NP-hard, heuristic solutions are mainly considered for the problem. In the thesis, the heuristic solutions for the DARPTW in paratransit include route construction and post-optimization. Insertion heuristics is used to construct initial routes. The …

    carleton Repository record for Inter-route optimization procedures for the dial-a-ride problem in Paratransit. (opens in a new tab)

  9. Aplicação de metaheurísticas para problemas de sequenciamento com lotes de tarefas

    Diversos processos industriais podem ser modelados através de problemas de sequenciamento. A otimização destes processos, por sua vez, é de grande interesse das indústrias já que pode acarretar em aumento da produtividade e lucratividade das mesmas. Algumas vezes, técnicas de loteamento podem ser …

    brazil-ufv Repository record for Aplicação de metaheurísticas para problemas de sequenciamento com lotes de tarefas (opens in a new tab)

  10. Advances and applications in high-dimensional heuristic optimization

    … optimizes all objectives. Evolutionary algorithms have emerged as a standard approach to determine a set of these Pareto optimal solutions, from which a decision-maker can select a vetted alternative. While easy to implement and having demonstrated great efficacy, these evolutionary …

    must-thes Repository record for Advances and applications in high-dimensional heuristic optimization (opens in a new tab)

  11. Efficient Spatial Search via Modified Attractive-Repulsive Particle Swarm Optimization for Autonomous Unmanned Vehicles

    Heuristic stochastic algorithms are widely utilized to solve complex optimization problems. Of these, a particularly useful subset are swarm intelligence methods, inspired by mimicry of observed collective biological behaviors. While these algorithms often demonstrate versatile problem-solving …

    jhu Repository record for Efficient Spatial Search via Modified Attractive-Repulsive Particle Swarm Optimization for Autonomous Unmanned Vehicles (opens in a new tab)

  12. A COMPARATIVE STUDY OF HEURISTIC OPTIMIZATION ALGORITHMS

    Heuristic optimization algorithms are of great importance for reaching solutions to various real world problems. These algorithms have a wide range of applications such as cost reduction, artificial intelligence, and medicine. By the term cost, one could imply that that cost is associated with, for …

    mtu Repository record for A COMPARATIVE STUDY OF HEURISTIC OPTIMIZATION ALGORITHMS (opens in a new tab)

  13. Heuristics for the family scheduling problems to minimize total tardiness

    … Therefore, this research aims to implement good heuristics that could provide good solutions within a reasonable time. This research can be divided into two main parts: problems with sequence independent setups and problems with sequence dependent setups. Integer programming models for both …

    ttu Repository record for Heuristics for the family scheduling problems to minimize total tardiness (opens in a new tab)

  14. Computation of exchange rates using discrete stochastic systems and algorithms

    … uncertainty. The developed models and algorithms allows for real-time, artificial intelligence-assisted interventions that stabilize exchange rates in the face of severe uncertainty. These findings demonstrate how targeted stochastic interventions change the dynamics of global currency …

    greece Repository record for Computation of exchange rates using discrete stochastic systems and algorithms (opens in a new tab)

  15. Τεχνικές εκτίμησης και επιλογής συγχρονισμένων μετρήσεων φασιθετών σε συστήματα ηλεκτρικής ενέργειας

    … this dissertation presents simple and effective algorithms concerning the observability analysis, checking and restoration, for systems including phasor measurement units as well as conventional measurements. Novel methods of optimal PMU placement based on heuristic and mathematical algorithms …

    greece Repository record for Τεχνικές εκτίμησης και επιλογής συγχρονισμένων μετρήσεων φασιθετών σε συστήματα ηλεκτρικής ενέργειας (opens in a new tab)

  16. Performance understanding and tuning of iterative computation using profiling techniques

    Most applications spend a significant amount of time in the iterative parts of a computation. They typically iterate over the same set of operations with different values. These values either depend on inputs or values calculated in previous iterations. While loops capture some iterative behavior, …

    gatech Repository record for Performance understanding and tuning of iterative computation using profiling techniques (opens in a new tab)

Page 1 of 2