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 111 for “"Heuristic algorithms"”.

  1. Sensitivity Analysis for Heuristic Algorithms

    Made available in DSpace on 2014-12-13T18:02:05Z (GMT). No. of bitstreams: 1 7913460.pdf: 4996780 bytes, checksum: 24e22abdab2c0b330dae4d5195c86768 (MD5) Previous issue date: 1978

    uiuc Repository record for Sensitivity Analysis for Heuristic Algorithms (opens in a new tab)

  2. Heuristic algorithms for wireless mesh network planning

    lethbridge

  3. Improving Market Risk Management with Heuristic Algorithms

    … active portfolio optimisation techniques with heuristic algorithms to manage new regulatory challenges faced in risk management. We first study if heuristic algorithms can support risk management to find global optimal solutions to reduce the regulatory capital requirements. In a benchmark …

    essex Repository record for Improving Market Risk Management with Heuristic Algorithms (opens in a new tab)

  4. Optimal distribution network reconfiguration using meta-heuristic algorithms

    … added to the distribution network. The heuristic optimization algorithm which is proposed in Chapter 3 and is improved in Chapter 5 is implemented on a smaller case study in Chapter 6 to demonstrate that the identified solution through the optimization process is the same with the …

    ucf

  5. Heuristic algorithms for distributed processor scheduling with limited memory

    This thesis studies a heuristic approach to scheduling •on a 2-processor distributed system when one processor has a limited memory. A program is assumed to consist of a set of sequentially executing modules and is represented by Stone's graph model. It is desired to assign these modules to the …

    rice Repository record for Heuristic algorithms for distributed processor scheduling with limited memory (opens in a new tab)

  6. An examination of heuristic algorithms for the travelling salesman problem

    The role of heuristics in combinatorial optimization is discussed. Published heuristics for the Travelling Salesman Problem (TSP) were reviewed and morphological boxes were used to develop new heuristics for the TSP. New and published heuristics were programmed for symmetric TSPs where the triangle …

    cape-town Repository record for An examination of heuristic algorithms for the travelling salesman problem (opens in a new tab)

  7. Enhancing meta-heuristic algorithms using center-based sampling at population level

    … enhance the efficiency and effectiveness of meta-heuristic algorithms. The strategy of center-based sampling can be utilized at either the operation and/or population levels. Despite the overall efficiency of the center-based sampling in population-based algorithms, utilization at the operation …

    uoit Repository record for Enhancing meta-heuristic algorithms using center-based sampling at population level (opens in a new tab)

  8. Hybrid Meta-heuristic Algorithms for Static and Dynamic Job Scheduling in Grid Computing

    … thesis studies the application of hybrid meta-heuristics to the job scheduling problem in grid computing, which is recognized as being one of the most important and challenging issues in grid computing environments. Similar to job scheduling in traditional computing systems, this allocation is …

    de-montfort Repository record for Hybrid Meta-heuristic Algorithms for Static and Dynamic Job Scheduling in Grid Computing (opens in a new tab)

  9. The design of public transit networks with heuristic algorithms : case study Cape Town

    … users and operators of the network. In doing so, heuristic solution algorithms are implemented in the design process, since they are known to generate better results for non-linear optimization problems than analytical ones. This algorithm which is named a Bus Route Network Design Algorithm …

    cape-town Repository record for The design of public transit networks with heuristic algorithms : case study Cape Town (opens in a new tab)

  10. Model parameter estimation of atherosclerotic plaque mechanical properties : calculus-based and heuristic algorithms

    A sufficient understanding of the pathology that leads to cardiovascular disease is currently deficient. Atherosclerosis is a complex disease that is believed to be initiated and promoted by linked biochemical and biomechanical pathways. This thesis focuses on studying plaque biomechanics because …

    mit Repository record for Model parameter estimation of atherosclerotic plaque mechanical properties : calculus-based and heuristic algorithms (opens in a new tab)

  11. Heuristic Algorithms for Adaptive Resource Management of Periodic Tasks in Soft Real-Time Distributed Systems

    … thesis proposes adaptive resource management heuristic techniques for periodic tasks in dynamic real-time distributed systems with the (soft real-time) objective of minimizing missed deadline ratios. The proposed resource management techniques continuously monitor the application tasks at …

    vt Repository record for Heuristic Algorithms for Adaptive Resource Management of Periodic Tasks in Soft Real-Time Distributed Systems (opens in a new tab)

  12. Definition of a Common Formulation of Military Frequency Assignment Problems and the Application of Meta-Heuristic Algorithms

    … in a form which allows the application of meta-heuristic algorithms. Currently different frequency assignment systems are in use in the four areas of the military, in the categories of land, air, maritime and satellite. The tasks are to define the common aspects of the relevant frequency …

    southwales Repository record for Definition of a Common Formulation of Military Frequency Assignment Problems and the Application of Meta-Heuristic Algorithms (opens in a new tab)

  13. Exact and Heuristic Algorithms for the Job Shop Scheduling Problem with Earliness and Tardiness Over a Common Due Date

    … researchers. This research develops exact and heuristic methods and algorithms to solve the job shop scheduling problem when the objective is to minimize both earliness and tardiness costs over a common due date. The objective function of minimizing earliness and tardiness costs captures the …

    odu Repository record for Exact and Heuristic Algorithms for the Job Shop Scheduling Problem with Earliness and Tardiness Over a Common Due Date (opens in a new tab)

  14. Service network design optimization for Army Aviation lift planning

    … service network design problem, and propose two heuristic algorithms, which compare favorably to current human planning systems. Furthermore, we apply these heuristic algorithms to long term asset planning and capacity requirement estimation for future military scenarios, and analyze how …

    mit Repository record for Service network design optimization for Army Aviation lift planning (opens in a new tab)

  15. Modelling and Design of Resilient Networks under Challenges

    … different networks. Furthermore, graph-theoretic heuristic optimisation algorithms are developed. These heuristic algorithms add links to increase the resilience of networks in the least costly manner and they are computationally less expensive than an exhaustive search algorithm. The performance …

    ku Repository record for Modelling and Design of Resilient Networks under Challenges (opens in a new tab)

  16. Scheduling Algorithms for Real-Time Systems

    … original contributions on real-time scheduling algorithms. The first topic studied in the thesis is minimizing the total penalty to be paid in scheduling a set of soft real-time tasks. The problem is NP-hard. We prove the properties of any optimal scheduling algorithm. We also derive a number of …

    queens Repository record for Scheduling Algorithms for Real-Time Systems (opens in a new tab)

  17. Parallel algorithms for placement and routing in VLSI design

    … Past research has focused on the development of heuristic algorithms, special purpose hardware accelerators, or parallel algorithms for the numerous design tasks to decrease the time required for solution. In this thesis, we propose two new parallel algorithms for two VLSl synthesis tasks, …

    uiuc Repository record for Parallel algorithms for placement and routing in VLSI design (opens in a new tab)

  18. Finding Hamiltonian Cycles

    … thesis various approaches of Hamiltonian cycle algorithms such as backtrack algorithms and heuristic algorithms, their basic ideas, and their actual implementations are studied. Three specific implementations are explained in detail and tested with randomly generated 4-regular planar graphs that …

    wku-diss Repository record for Finding Hamiltonian Cycles (opens in a new tab)

Page 1 of 6