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 1078 for “"simulated annealing"”.

  1. Mobile Sensor movement using Simulated Annealing

    … for Heterogenenous Sensor Networks using a Simulated annealing search technique. This paper also discusses the various factors that are taken into account while making a decision about the movement of a mobile sensor node in the event of a sensor node failure. With the help of Simulated …

    ndsu Repository record for Mobile Sensor movement using Simulated Annealing (opens in a new tab)

  2. Relaxing synchronization in distributed simulated annealing

    "Simulated annealing is an attractive, but expensive, heuristic for approximating the solution to combinatorial optimization problems. Since simulated annealing is a general purpose method, it can be applied to the broad range of NP-complete problems such as the traveling salesman problem, graph …

    must-thes Repository record for Relaxing synchronization in distributed simulated annealing (opens in a new tab)

  3. Identifying algorithmic vulnerabilities through simulated annealing

    Includes bibliographical references (page 55).

    colo-mines Repository record for Identifying algorithmic vulnerabilities through simulated annealing (opens in a new tab)

  4. Simulated annealing in sonar track detection

    … are too sensitive to noise. This thesis uses Simulated Annealing for the solution by formulating the sonar track detection problem as an optimization problem. the experimental results are much better than those of classical edge detectors. Fairly good results can be obtained on data with SNR …

    nps Repository record for Simulated annealing in sonar track detection (opens in a new tab)

  5. Parallelization of the simulated annealing algorithm.

    … Instead, heuristic algorithms, such as the simulated annealing algorithm, have been employed and have proven effective in minimizing such energy functionals. Unfortunately, the simulated annealing algorithm, as characteristic of Monte Carlo algorithms, is very computer intensive; in fact, it …

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

  6. Projection and clustering by simulated annealing

    Thesis (M.S.)--Michigan State University. Department of Computer Science, 1987

    msu Repository record for Projection and clustering by simulated annealing (opens in a new tab)

  7. Simulated Annealing Approach To Flow Shop Scheduling

    … an algorithm adopting a heuristic called Simulated Annealing, to act as a support to the Flow Shop Scheduling. This algorithm tries to deliver good/near optimal solutions to the given scheduling problem, in a reasonable time. We also carry out various tests to determine the behavior of the …

    unlv Repository record for Simulated Annealing Approach To Flow Shop Scheduling (opens in a new tab) Download PDF for Simulated Annealing Approach To Flow Shop Scheduling (opens in a new tab)

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

  9. On applications of simulated annealing to cryptology

    … such functions. In this thesis, we apply simulated annealing methods to construct Boolean functions with particular properties. Our results meet or exceed the best results of available theoretical constructions and/or heuristic searches in the literature, including a 10-variable balanced …

    concordia Download PDF for On applications of simulated annealing to cryptology (opens in a new tab)

  10. Application of simulated annealing to some seismic problems

    … to a certain set of unknown parameters. I use simulated annealing (SA) to avoid local minima and inaccurate solutions often arising by the use of linearizing methods. I illustrate all applications using numerical and/or real data examples. The first application concerns the 4th-order cumulant …

    ubc Repository record for Application of simulated annealing to some seismic problems (opens in a new tab) Download PDF for Application of simulated annealing to some seismic problems (opens in a new tab)

  11. Simulated annealing applied to a file allocation problem

    The simulated annealing is applied to an instance of the file allocation problem. The implementation of the algorithm is demonstrated using this example. A study of the effects of using different penalty functions on this problem is performed. The results indicate that the choice of penalty …

    ubc Repository record for Simulated annealing applied to a file allocation problem (opens in a new tab) Download PDF for Simulated annealing applied to a file allocation problem (opens in a new tab)

  12. AccuSyn: Using Simulated Annealing to Declutter Genome Visualizations

    We apply Simulated Annealing, a well-known metaheuristic for obtaining near-optimal solutions to optimization problems, to discover conserved synteny relations (similar features) in genomes. The analysis of synteny gives biologists insights into the evolutionary history of species and the …

    sask Repository record for AccuSyn: Using Simulated Annealing to Declutter Genome Visualizations (opens in a new tab)

  13. Permutation Flow Shop via Simulated Annealing and NEH

    … thesis, we have used two heuristics - NEH and Simulated Annealing, both individually and in a combined form, to find the solutions for Permutation Flow Shop problems. We have compared NEH and Simulated Annealing algorithm based on result and execution time and also compared the combined …

    unlv Repository record for Permutation Flow Shop via Simulated Annealing and NEH (opens in a new tab) Download PDF for Permutation Flow Shop via Simulated Annealing and NEH (opens in a new tab)

  14. Simulated Annealing with min-cut and greedy perturbations

    … satisfactory results under time constraints. Simulated Annealing is an algorithm which uses randomly generated perturbations to adjust a single solution. The effect of a generated perturbation is examined by a cost function which evaluates the solution. If the perturbation decreases the cost, …

    rit Repository record for Simulated Annealing with min-cut and greedy perturbations (opens in a new tab)

Page 1 of 54