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

  1. Analysis of simulated annealing type algorithms

    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1987.

    mit Repository record for Analysis of simulated annealing type algorithms (opens in a new tab)

  2. Processor and link assignment using simulated annealing

    … to both aspects of the mapping problem using the simulated annealing optimization heuristic. A two phase mapping strategy is formulated: I) process annealing assigns parallel processes to processing nodes, and 2) connection annealing schedules traffic connections on network data links so that …

    vt Repository record for Processor and link assignment using simulated annealing (opens in a new tab)

  3. Maximum likelihood time-domain beamforming using simulated annealing

    … to estimate the source bearings and time series. Simulated annealing is used to implement the resulting time-domain beamformer. Broadband signals in spatially correlated noise are treated. Previous time-domain beamformers did not consider the correlation between random noise, and they did not use …

    woods-hole Repository record for Maximum likelihood time-domain beamforming using simulated annealing (opens in a new tab)

  4. Computational Solution Of Inverse Problems With Simulated Annealing

    … minimum where the quasi-solution exists.;The simulated annealing algorithm performs well at minimizing functions with multiple local minima and hence has been employed in the quasi-solution of the inverse problem. Regularization techniques in the area of inverse problems attempt to better …

    uwo Repository record for Computational Solution Of Inverse Problems With Simulated Annealing (opens in a new tab)

  5. Optimization by Simulated Annealing: A Time-Complexity Analysis

    … random search optimization method called simulated annealing are given. Most of the results are concerned with the average amount of time simulated annealing takes to find an acceptable solution.

    uiuc Repository record for Optimization by Simulated Annealing: A Time-Complexity Analysis (opens in a new tab)

  6. Maximum likelihood time-domain beamforming using simulated annealing

    Thesis (S.M.)--Joint Program in Oceanographic Engineering (Massachusetts Institute of Technology, Dept. of Ocean Engineering; and the Woods Hole Oceanographic Institution), 1999.

    mit Repository record for Maximum likelihood time-domain beamforming using simulated annealing (opens in a new tab)

  7. 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)

  8. Parallel algorithms for standard cell placement using simulated annealing

    … VLSI design process is the placement process. Simulated-annealing-based approaches have been the most popular and effective methods for cell placement. In this thesis, parallelization approaches to simulated-annealing-based standard cell placement are presented.

    uiuc Repository record for Parallel algorithms for standard cell placement using simulated annealing (opens in a new tab)

  9. Simulated annealing algorithm for customer-centric location routing problem

    … we introduce three different variations of Simulated Annealing (SA) algorithm to solve the Capacitated Latency Location Routing Problem (CLLRP). According to the comparison results on a popular benchmark test, one of the designed SAs, the Iterative Simulated Annealing algorithm, consistently …

    mit Repository record for Simulated annealing algorithm for customer-centric location routing problem (opens in a new tab)

  10. Calibration of a conceptual rainfall-runoff model using simulated annealing

    Simulated annealing (Kirkpatrick et al, 1983) is used to estimate the parameters of a mathematical model that predicts the water yield from a catchment. The calibration problem involves finding the global minimum of a multivariate function that has many extraneous local minima, a situation in which …

    edithcowan Repository record for Calibration of a conceptual rainfall-runoff model using simulated annealing (opens in a new tab)

  11. Learning of Type-2 Fuzzy Logic Systems using Simulated Annealing.

    This thesis reports the work of using simulated annealing to design more efficient fuzzy logic systems to model problems with associated uncertainties. Simulated annealing is used within this work as a method for learning the best configurations of type-1 and type-2 fuzzy logic systems to maximise …

    de-montfort Repository record for Learning of Type-2 Fuzzy Logic Systems using Simulated Annealing. (opens in a new tab)

  12. Solving concentrator location and terminal assignment problems using simulated annealing

    … to develop some efficient algorithms based on simulated annealing to solve these problems. The results are compared to those given by some existing heuristics.

    concordia Repository record for Solving concentrator location and terminal assignment problems using simulated annealing (opens in a new tab)

  13. Image segmentation by texture discrimination using variations of simulated annealing

    Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002.

    mit Repository record for Image segmentation by texture discrimination using variations of simulated annealing (opens in a new tab)

  14. Uma Proposta de especificação formal e fundamentação teórica para simulated annealing

    Os algoritmos baseados no paradigma Simulated Annealing e suas variações são atualmente usados de forma ampla na resolução de problemas de otimização de larga escala. Esta popularidade é resultado da estrutura extremamente simples e aparentemente universal dos algoritmos, da aplicabilidade geral e …

    brazil-ufrgs Repository record for Uma Proposta de especificação formal e fundamentação teórica para simulated annealing (opens in a new tab)

  15. Resolving Graphic Conflict In Scale Reduced Maps: A Simulated Annealing Approach

    … use of the stochastic optimisation technique of simulated annealing for cartographic map generalisation. The technique performs operations of displacement, deletion, reduction and enlargement of multiple map objects in order to resolve graphic conflict resulting from a reduction in map scale. A …

    southwales Repository record for Resolving Graphic Conflict In Scale Reduced Maps: A Simulated Annealing Approach (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. Dual Constraint Problem Optimization Using A Natural Approach: Genetic Algorithm and Simulated Annealing

    … a timely mam1er. The Genetic Algorithm and the Simulated Annealing algorithm can both be used to achieve this goal, although Simulated Annealing outperforms the Genetic Algorithm for use by the GRB. Determining optimal values for the variables used in each algorithm is often achieved through …

    unf Repository record for Dual Constraint Problem Optimization Using A Natural Approach: Genetic Algorithm and Simulated Annealing (opens in a new tab)

Page 1 of 14