On Tue, 7 Sep 1999, Matt Gingell wrote:
> I donít think there can be any general solution to the problem of
> local optima. There are lots of different useful techniques, but any
> hill-climbing algorithm can potentially get stuck. Itís a question of
> the topology of the search space, which can be arbitrarily complex
If you use a 'population' of searches, combined with multiplication (split the ones at a good point in space and remove the bottom feeders) and random bitflipping (flip a random bit in 10% of the searchers) you might be able to get around the problem.
-- The Internet is not a network of computers. It is a network of people. That is its real strength. -- work at: http://www.reseau.nl/ home at: http://www.nl.linux.org/~riel/