Dictionary:drunkard’s walk

From SEG Wiki
Jump to: navigation, search

Other languages:

Warning: Display title "Dictionary:drunkard’s walk" overrides earlier display title "Dictionary:Drunkard’s walk".

A simulated annealing algorithm to find an optimum in model space by sometimes taking steps in random fashion but gradually biasing the walk by taking more steps in the ‘‘uphill’’ direction (assuming a maximum is sought).