Genetic Algorithms vs. Monte Carlo

AI Thread Summary
The discussion focuses on identifying simple problems or projects that can be addressed using both genetic algorithms and Monte Carlo methods, including simulated annealing and Metropolis-Hastings. Participants suggest that circuit optimization problems are suitable for both approaches. Additionally, the Rosenbrock function is mentioned as a specific example, raising the question of whether either method can effectively find its global minimum. The conversation emphasizes the versatility of these algorithms in solving optimization problems.
maverick_starstrider
Messages
1,118
Reaction score
7
Hi, other than the Traveling Salesman Problems can anyone help me think of relatively simple problems/projects that are solvable through BOTH genetic algorithm techniques AND monte-carlo methods (such as simulated annealing and metropolis-hastings). Any help is greatly appreciated.
 
Technology news on Phys.org
maverick_starstrider said:
Hi, other than the Traveling Salesman Problems can anyone help me think of relatively simple problems/projects that are solvable through BOTH genetic algorithm techniques AND monte-carlo methods (such as simulated annealing and metropolis-hastings). Any help is greatly appreciated.

You certainly can use both on circuit optimization problems.
 
Find the global minimum of Rosenbrock's function,

f(x,y) = (1-x)^2 + 100\left(y-x^2\right)^2
 
Can either method find a global minimum?
 
Thread 'Is this public key encryption?'
I've tried to intuit public key encryption but never quite managed. But this seems to wrap it up in a bow. This seems to be a very elegant way of transmitting a message publicly that only the sender and receiver can decipher. Is this how PKE works? No, it cant be. In the above case, the requester knows the target's "secret" key - because they have his ID, and therefore knows his birthdate.
Back
Top