Random Walk
A random walk algorithm sometimes moves like a greedy algorithm but sometimes moves randomly. It depends on a parameter, which is a real number between 0 and 1. At every move, with probability the algorithm proceeds like a greedy algorithm, trying to maximally decrease the cost of the assignment. With probability, however, the solution is changed in some other way, which involves some degree of randomness.
Read more about this topic: Local Search (constraint Satisfaction)
Famous quotes containing the words random and/or walk:
“Assemble, first, all casual bits and scraps
That may shake down into a world perhaps;
People this world, by chance created so,
With random persons whom you do not know—”
—Robert Graves (1895–1985)
“Theoretically, we know that the world turns, but in fact we do not notice it, the earth on which we walk does not seem to move and we live on in peace. This is how it is concerning Time in our lives. And to render its passing perceptible, novelists must... have their readers cross ten, twenty, thirty years in two minutes.”
—Marcel Proust (1871–1922)