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 37 for “"Simulated annealing (Mathematics)"”.

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

  2. Random methods for rectilinear steiner tree problem with applications in VLSI design

    … To solve this problem two random methods. Simulated Annealing (SA) and Stochastic Evolution (SE) were investigated and implemented using an object oriented design. Both Simulated Annealing and Stochastic Evolution are tunable algorithms and their performance is highly dependent on the …

    ttu Repository record for Random methods for rectilinear steiner tree problem with applications in VLSI design (opens in a new tab)

  3. Combinatorial optimization in VLSI physical design

    Simulated Annealing is a general purpose combinatorial optimization technique which has been applied to many problems in VLSI design. In essence, simulated annealing is Monte Carlo iterative improvement with the ability to conditionally accept uphill moves. The notion of a cooling schedule is …

    uvic Repository record for Combinatorial optimization in VLSI physical design (opens in a new tab)

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

  5. Dynamically determining search parameters for Monte Carlo optimization

    Includes bibliographical references (pages 72-75).

    colo-mines Repository record for Dynamically determining search parameters for Monte Carlo optimization (opens in a new tab)

  6. Understanding and design of molecular dynamics based simulation methods.

    … pressure along with temperature in analogue with simulated annealing. The method is tested against simulated annealing for condensed phase systems of argon, monoglyme, and tetraglyme. The method noticeably improves the results for the glyme systems, but does not seem to hurt the results for the …

    oklahoma-thes Repository record for Understanding and design of molecular dynamics based simulation methods. (opens in a new tab)

  7. Simultaneous determination of relative permeability and capillary pressure from displacement data by simulated annealing.

    … values, and piece-wise local functions. The simulated annealing method is implemented for non-linear global optimization. Applications to unsteady-state drainage and imbibition, and steady-state core flood tests are presented. Global functional representations of the relative permeability and …

    oklahoma-thes Repository record for Simultaneous determination of relative permeability and capillary pressure from displacement data by simulated annealing. (opens in a new tab)

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

  9. An efficient annealing algorithm for global optimization in Boltzmann machines

    <p>This thesis proposes a new annealing algorithm for Boltzmann Machines. This algorithm uses an Exponential Formula for temperature scheduling that produces remarkably better solutions for global optimization. The superiority of the new algorithm is shown by computer simulations of several …

    njit Repository record for An efficient annealing algorithm for global optimization in Boltzmann machines (opens in a new tab)

  10. Point pattern matching by heuristic methods : a genetic algorithm and simulated annealing

    … searching techniques - a genetic algorithm and simulated annealing to search for the best ("almost the best") assignment efficiently. To make the comparison between GA and SA fair, we introduce a piece-wise linear cooling schedule for the SA. As compared to conventional searching techniques such …

    njit Repository record for Point pattern matching by heuristic methods : a genetic algorithm and simulated annealing (opens in a new tab)

Page 1 of 2