Instance-Specific Algorithm Configuration
Autor Yuri Malitskyen Limba Engleză Hardback – 3 dec 2014
The author's related thesis was honorably mentioned (runner-up) for the ACP Dissertation Award in 2014, and this book includes some expanded sections and notes on recent developments. Additionally, the techniques described in this book have been successfully applied to a number of solvers competing in the SAT and MaxSAT International Competitions, winning a total of 18 gold medals between 2011 and 2014.
The book will be of interest to researchers and practitioners in artificial intelligence, in particular in the area of machine learning and constraint programming.
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 324.98 lei 6-8 săpt. | |
Springer International Publishing – 23 aug 2016 | 324.98 lei 6-8 săpt. | |
Hardback (1) | 331.08 lei 6-8 săpt. | |
Springer International Publishing – 3 dec 2014 | 331.08 lei 6-8 săpt. |
Preț: 331.08 lei
Preț vechi: 413.85 lei
-20% Nou
Puncte Express: 497
Preț estimativ în valută:
63.36€ • 65.75$ • 52.96£
63.36€ • 65.75$ • 52.96£
Carte tipărită la comandă
Livrare economică 15-29 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783319112299
ISBN-10: 3319112295
Pagini: 160
Ilustrații: IX, 134 p. 13 illus., 11 illus. in color.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.38 kg
Ediția:2014
Editura: Springer International Publishing
Colecția Springer
Locul publicării:Cham, Switzerland
ISBN-10: 3319112295
Pagini: 160
Ilustrații: IX, 134 p. 13 illus., 11 illus. in color.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.38 kg
Ediția:2014
Editura: Springer International Publishing
Colecția Springer
Locul publicării:Cham, Switzerland
Public țintă
ResearchCuprins
Introduction.- Survey of Related Work.- Architecture of Instance-Specific Algorithm Configuration Approach.- Applying ISAC to Portfolio Selection.- Generating a Portfolio of Diverse Solvers.- Handling Features.- Developing Adaptive Solvers.- Making Decisions Online.- Conclusions.
Notă biografică
Dr. Yuri Malitsky received his PhD from Brown University in 2012 for his work on the Instance-Specific Algorithm Configuration (ISAC) approach. He was a postdoc in the Cork Constraint Computation Centre from 2012 to 2014. He is now a postdoc at the IBM Thomas J. Watson Research Center, working on problems in machine learning, combinatorial optimization, data mining, and data analytics.
Dr. Malitsky's research focuses on applying machine learning techniques to improve the performance of combinatorial optimization and constraint satisfaction solvers. In particular, his work centers around automated algorithm configuration, algorithm portfolios, algorithm scheduling, and adaptive search strategies, aiming to develop the mechanisms to determine the structures of problems and their association with the behaviors of different solvers, and to develop methodologies that automatically adapt existing tools to the instances they will be evaluated on.
Dr. Malitsky's research focuses on applying machine learning techniques to improve the performance of combinatorial optimization and constraint satisfaction solvers. In particular, his work centers around automated algorithm configuration, algorithm portfolios, algorithm scheduling, and adaptive search strategies, aiming to develop the mechanisms to determine the structures of problems and their association with the behaviors of different solvers, and to develop methodologies that automatically adapt existing tools to the instances they will be evaluated on.
Textul de pe ultima copertă
This book presents a modular and expandable technique in the rapidly emerging research area of automatic configuration and selection of the best algorithm for the instance at hand. The author presents the basic model behind ISAC and then details a number of modifications and practical applications. In particular, he addresses automated feature generation, offline algorithm configuration for portfolio generation, algorithm selection, adaptive solvers, online tuning, and parallelization.
The author's related thesis was honorably mentioned (runner-up) for the ACP Dissertation Award in 2014, and this book includes some expanded sections and notes on recent developments. Additionally, the techniques described in this book have been successfully applied to a number of solvers competing in the SAT and MaxSAT International Competitions, winning a total of 18 gold medals between 2011 and 2014.
The book will be of interest to researchers and practitioners in artificial intelligence, in particular in the area of machine learning and constraint programming.
The author's related thesis was honorably mentioned (runner-up) for the ACP Dissertation Award in 2014, and this book includes some expanded sections and notes on recent developments. Additionally, the techniques described in this book have been successfully applied to a number of solvers competing in the SAT and MaxSAT International Competitions, winning a total of 18 gold medals between 2011 and 2014.
The book will be of interest to researchers and practitioners in artificial intelligence, in particular in the area of machine learning and constraint programming.
Caracteristici
Author presents the basic model and also details practical applications Interesting for researchers and practitioners in machine learning and constraint programming Technique presented is modular and expandable Includes supplementary material: sn.pub/extras