Dr. James McCaffrey of Microsoft Research shows how to implement simulated annealing for the Traveling Salesman Problem (find the best ordering of a set of discrete items). The goal of a combinatorial ...

If you want to simulate a tic-tac-toe game, that’s easy. You can evaluate every possible move in a reasonable amount of time. Simulating antennas, however, is much harder. [Rosrislav] has been ...

The classical approach to statistical analysis is usually based upon finding values for model parameters that maximize the likelihood function. Model choice in this context is often also based on the ...

Journal of Applied Probability, Vol. 38, No. 4 (Dec., 2001), pp. 975-994 (20 pages) Simulated annealing is a popular and much studied method for maximizing functions on finite or compact spaces. For ...

1- Is it possible to avoid local minima by combining a crude form of simulated annealing with backprop?<BR><BR>specifically, make the activation or weights stochastic, and gradually reduce the ...