Assume that Davis's Bit Hill Climbing and Steepest Descent Hill Climbing algorithms are run for 10 minutes to solve a MAX-SAT problem instance resulting in the average objective values of 12.4 and 3.8, respectively, over 30 runs/trials.

Which algorithm would perform the best for solving MAX-SAT problems assuming a minimisation problem formulation?

Question

Assume that Davis's Bit Hill Climbing and Steepest Descent Hill Climbing algorithms are run for 10 minutes to solve a MAX-SAT problem instance resulting in the average objective values of 12.4 and 3.8, respectively, over 30 runs/trials. 
   
 Which algorithm would perform the best for solving MAX-SAT problems assuming a minimisation problem formulation?

Accepted Answer

It is not possible to determine

Answer

Steepest Descent Hill Climbing

Answer

Davis's Bit Hill Climbing

Answer

Both algorithms would perform the same

Crowdly

Assume that Davis's Bit Hill Climbing and Steepest Descent Hill Climbing algo...

Want instant access to all verified answers on moodle.nottingham.ac.uk?