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

In heart transplantation, selection of an optimal recipient-donor match has been constrained by the lack of individualized prediction models. Here we developed a customized donor-matching model ...

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

We present a novel multi-objective optimization algorithm, Archived Multi-Objective Simulated Annealing (AMOSA), based on simulated annealing for transient electromagnetic (TEM) one-dimensional ...

Dr. James McCaffrey of Microsoft Research explains a new idea that slightly modifies standard simulated annealing by borrowing ideas from quantum mechanics. The goal of a combinatorial optimization ...

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