Restarting is a technique employed by many algorithms. For some problems, restarts improve the runtimes by orders of magnitude. This thesis considers several aspects of restarts. In addition to complexity-theoretical properties, we also study methods for constructing optimal restart strategies. On the practical side, we apply restarts to significantly improve the performance of a SAT solver.
Read More
Restarting is a technique employed by many algorithms. For some problems, restarts improve the runtimes by orders of magnitude. This thesis considers several aspects of restarts. In addition to complexity-theoretical properties, we also study methods for constructing optimal restart strategies. On the practical side, we apply restarts to significantly improve the performance of a SAT solver.
Read Less
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
PLEASE NOTE, WE DO NOT SHIP TO DENMARK. New Book from multilingual publisher. Shipped from UK within 4 to 14 days. Please check language within the description.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
PLEASE NOTE, WE DO NOT SHIP TO DENMARK. New Book from multilingual publisher. Shipped from UK within 4 to 14 days. Please check language within the description.