simAnealing

  Simulated annealing (SA) is a generic probabilistic metaheuristic for the global optimization problem of applied mathematics, namely locating a good approximation to the global optimum of a given function in a large search space. It is often used when the search space is discrete (e.g., all tours that visit a given set of cities). For certain problems, simulated annealing may be more effective than exhaustive enumeration — provided that the goal is merely to find an acceptably good solution in a fixed amount of time, rather than the best possible solution.

simAnealing
...........\addrulefun.asv,1123,2010-05-09
...........\addrules.m,114,2010-05-10
...........\alaki.asv,1527,2010-05-05
...........\computeMse.asv,216,2010-05-11
...........\computeMse.m,216,2010-05-11
...........\createFis.m,199,2010-05-10
...........\mse.m,66,2007-11-16
...........\partition.m,577,2007-11-15
...........\plotting.m,204,2007-11-23
...........\project1.asv,513,2010-05-17
...........\project1.m,540,2010-05-22
...........\search.asv,291,2010-05-10
...........\search.m,297,2010-05-09
...........\simAnnealing.asv,1007,2010-05-20
...........\simAnnealing.m,642,2010-05-20
...........\testdata.m,195,2010-05-06
...........\traindata.asv,1103,2010-05-20
...........\traindata.m,1103,2010-05-20
...........\WangMendel.asv,1209,2010-05-20
...........\WangMendel.m,1209,2010-05-20