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 127 for “"Simulated annealing algorithm"”.

  1. Parallelization of the simulated annealing algorithm.

    … search for an optimum, and in many cases no algorithms are known which will determine the exact optimum with significantly less work than exhaustive search. Instead, heuristic algorithms, such as the simulated annealing algorithm, have been employed and have proven effective in minimizing …

    arizona-thes Repository record for Parallelization of the simulated annealing algorithm. (opens in a new tab)

  2. A SIMULATED ANNEALING ALGORITHM FOR DETECTING MOVING TARGETS

    … This thesis adopts a random search method called simulated annealing and customizes it to the unique setting of target tracking to obtain a sensor configuration that approximately maximizes the target detection probability, accounting for uncertainty in intelligence information. To evaluate the …

    nps Repository record for A SIMULATED ANNEALING ALGORITHM FOR DETECTING MOVING TARGETS (opens in a new tab)

  3. Modeling of a hardware VLSI placement system: Accelerating the Simulated Annealing algorithm

    … or sheer compute effort required. Heuristic algorithms allow for efficient but sub-optimal designs to be produced with a reduction in processing time. A widely used algorithm is Simulated Annealing (SA). The goal of this work was to develop a model that would enable an analysis into the …

    rit Repository record for Modeling of a hardware VLSI placement system: Accelerating the Simulated Annealing algorithm (opens in a new tab)

  4. Protein Folding Implementation of the Simulated Annealing Algorithm on Simple Three-Dimensional Models

    … proteins fold. This thesis studies the use of simulated annealing optimization techniques to find low energy states in simple lattice and off-lattice models. A certain emphasis is placed upon looking for patterns in the results emerging. One simple off-lattice model and two lattice models are …

    chalmers Repository record for Protein Folding Implementation of the Simulated Annealing Algorithm on Simple Three-Dimensional Models (opens in a new tab)

  5. A Mathematical Model and a Simulated Annealing Algorithm for an Integrated Facility Layout and Cell Formation

    … the model for large size problems, an efficient simulated annealing algorithm is developed. A number of numerical examples of different sizes are presented to demonstrate the nature of the proposed model. In addition, some empirical studies to demonstrate the computational behaviours of the …

    guelph Repository record for A Mathematical Model and a Simulated Annealing Algorithm for an Integrated Facility Layout and Cell Formation (opens in a new tab)

  6. Characterizing the protein landscape in thylakoid membranes of Chlamydomonas reinhardtii using a Monte Carlo-simulated annealing algorithm

    … employs coarse-grained modeling and advanced algorithms to simulate the distribution of major protein complexes, including PSII supercomplexes, cytb₆f, and LHCII. By systematically varying membrane size and protein composition, we analyzed protein organization using statistical methods such as …

    texas Repository record for Characterizing the protein landscape in thylakoid membranes of Chlamydomonas reinhardtii using a Monte Carlo-simulated annealing algorithm (opens in a new tab)

  7. Maksimalių klikų paieška naudojant vėsinimo imitaciją /

    … One of the heuristic methods is known as the simulated annealing method. It is used to approximate the global optimum of the given function. Bachelor thesis main objective is to apply simulated annealing method for the clique enumeration problem. Tasks include: algorithm review, explanation of …

    vilnius Repository record for Maksimalių klikų paieška naudojant vėsinimo imitaciją / (opens in a new tab)

  8. Inverse Problem in Porous Medium Using Homogenization

    … of two different pieces that work together. A simulated annealing algorithm is presented and coupled with an homogenization technique; together these solve the problem which was posed. Further, numerical simulation results are presented illustrating the use of the simulated annealing algorithm …

    utahstate Repository record for Inverse Problem in Porous Medium Using Homogenization (opens in a new tab)

  9. Metaheuristics and machine learning for joint stratification and sample allocation in survey design

    … the sampling frame is large, and the evaluation algorithm is computationally burdensome. To advance the research in this area, we explore and evaluate different algorithmic methods of modelling and solving this problem. Firstly, we propose a new genetic algorithm approach using "grouping" genetic …

    cork Repository record for Metaheuristics and machine learning for joint stratification and sample allocation in survey design (opens in a new tab) Restricted access

  10. Simulated annealing heuristics for the dynamic facility layout problem

    … facility layout problem. In this thesis, three simulated annealing heuristics are presented for the dynamic facility layout problem. The first is the direct implementation of the simulated annealing algorithm. The second heuristic uses a reheating strategy within simulated annealing. The third …

    wvu Repository record for Simulated annealing heuristics for the dynamic facility layout problem (opens in a new tab)

  11. Optical design by genetic algorithm

    … and birefringent filters by using the genetic algorithm is studied in this thesis. A holographic diffuser is an optical device that distributes light from a light source with a desired spatial distribution pattern. For diffuse infrared wireless home networking, a holographic diffuser is used to …

    ottawa-retro Repository record for Optical design by genetic algorithm (opens in a new tab)

  12. Synthesis of Analogue Circuits

    … and library cells to be adopted easily. An algorithm to synthesise analogue circuits from over-designed circuits is described in this thesis. The technique to select circuit topologies from over-designed circuits and to fine-tune the selected circuit is based on the Simulated Annealing …

    soton Download PDF for Synthesis of Analogue Circuits (opens in a new tab)

  13. Assessment and Redesign of the Synoptic Water Quality Monitoring Network in the Great Smoky Mountains National Park

    … trends. The spatial analysis employed a simulated annealing algorithm using the variable costs of the network and the results of multivariate data techniques to identify an optimized subset of the existing sampling sites based on a maximization of benefits. A second simulated annealing …

    utk-theses Repository record for Assessment and Redesign of the Synoptic Water Quality Monitoring Network in the Great Smoky Mountains National Park (opens in a new tab)

  14. Agent based modelling of an emergency department and path planning optimization of a mobile real time location system

    … and optimized using metaheuristic genetic and simulated annealing algorithms. A prototypical agent model for an emergency facility was created using AnyLogic simulation software. The emergency department model is outfitted with mRTLS using mobile, ceiling-mounted RFID readers. Path planning and …

    manitoba Repository record for Agent based modelling of an emergency department and path planning optimization of a mobile real time location system (opens in a new tab)

  15. Adaptive Simulated Annealing: An Alternative Approach for the Error Minimization of Neural Networks

    <p>This work introduces an alternative algorithm, simulated annealing, to minimize the prediction error from neural networks that traditionally use back-propagation methods. The simulated annealing algorithm stochastically samples the parameter space formed by weights of the neural network until a …

    ut-knoxville Repository record for Adaptive Simulated Annealing: An Alternative Approach for the Error Minimization of Neural Networks (opens in a new tab)

  16. An eigenvalue-based approach to the finite time behavior of simulated annealing

    … under which the finite time behavior of the simulated annealing for combinatorial optimization can be studied. We will use linear algebraic methods for this purpose. The simulated annealing algorithm will be modeled as a finite space, discrete time Markov chain which can then be represented …

    uiuc Repository record for An eigenvalue-based approach to the finite time behavior of simulated annealing (opens in a new tab)

  17. Evolutionary variance of gene network model via simulated annealing

    … of the resulting gene network. Thus, we used simulated annealing algorithm to calculate a high fitness and optimal parameters of the gene network. The simulated annealing algorithm is suitable for calculating many degree of freedom (Tomshine and Kaznessis, 2006), and is the closest analogy …

    iastate Repository record for Evolutionary variance of gene network model via simulated annealing (opens in a new tab)

Page 1 of 7