En cours de chargement...
Restart Strategies - E-book - PDF
Edition en anglais
Résumé
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.
Caractéristiques
-
Date de parution25/10/2021
-
Editeur
-
ISBN978-3-7543-7739-0
-
EAN9783754377390
-
FormatPDF
-
Nb. de pages286 pages
-
Caractéristiques du format PDF
-
Pages286
-
Taille1 485 Ko
-
Protection num.pas de protection
-
Avis libraires et clients
Avis audio
Écoutez ce qu'en disent nos libraires !
À propos des auteurs
Jan-Hendrik Lorenz completed his Bachelor's and Master's studies at Ulm University. He conducted his doctoral studies at the Institute for Theoretical Computer Science at Ulm University. Of his published works, a total of three were awarded the Best Student Paper Award.
The editor Thom Frühwirth is a professor of Computer Science at the University of Ulm, Germany. He is the designer of the programming language Constraint Handling Rules (CHR) and author of the book by the same name.
He has also co-authored two leading textbooks on constraint programming and reasoning. The editor Uwe Schöning is a professor of Theoretical Computer Science at the University of Ulm, Germany. He introduced the low and high hierarchies to structural complexity theory to describe the internal structure of the complexity class NP. Later, he invented a much-cited SAT-Algorithm. He has also authored several popular textbooks on Logic in Computer Science.
He has also co-authored two leading textbooks on constraint programming and reasoning. The editor Uwe Schöning is a professor of Theoretical Computer Science at the University of Ulm, Germany. He introduced the low and high hierarchies to structural complexity theory to describe the internal structure of the complexity class NP. Later, he invented a much-cited SAT-Algorithm. He has also authored several popular textbooks on Logic in Computer Science.