I would adjust the guess by a fraction of the error. This is basically a gradient following rule. I.e.:
Guess(t+1) = Guess(t) + alpha Error where alpha is some parameter that you set via your simulated annealing HTH, N. On Wed, Nov 24, 2010 at 1:38 AM, Danny Yoo <d...@cs.wpi.edu> wrote: > Hi everyone, > > In Moby (my Racket->JS evaluator), I have a parameter that checks the > number of steps that the evaluator takes: after a certain threshold, > the evaluator temporarily yields control back to the browser, and > schedules itself for a restart. I have a rate at which I want the > evaluator to yield --- about five times a second. However, I don't > know how fast my evaluator actually runs per step. > ... _________________________________________________ For list-related administrative tasks: http://lists.racket-lang.org/listinfo/users
