4 ms·
This is a class of problems that Monte Carlo optimization (GA's, simulated annealing, etc.) typically can't solve, because almost-solutions are generally really
by ganley 17y ago
This is a class of problems that Monte Carlo optimization (GA's, simulated annealing, etc.) typically can't solve, because almost-solutions are generally really deep local minima that the search machinery can't climb out of.