Full Product Details
Author: Youssef Hamadi
Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Edition: Softcover reprint of the original 1st ed. 2013
Dimensions:
Width: 15.50cm
, Height: 0.80cm
, Length: 23.50cm
Weight: 2.467kg
ISBN: 9783662514290
ISBN 10: 366251429
Pages: 139
Publication Date: 23 August 2016
Audience:
Professional and scholarly
,
Professional & Vocational
Format: Paperback
Publisher's Status: Active
Availability: Manufactured on demand
We will order this item for you from a manufactured on demand supplier.
Reviews
The book deals with combinatorial search algorithms for NP-hard problems, focusing on knowledge sharing in combinatorial search. ... The diversity and originality of the proposed methods could be helpful for researchers, practitioner and graduate students working in optimization, search, and computational complexity. (Smaranda Belciug, zbMATH 1317.68003, 2015) The focus of this book is knowledge sharing in combinatorial search, a topic that is of considerable current importance in the quest for solutions to NP-hard problems. ... This is an exceptionally well-written book, which, while primarily presenting the author's own research, also provides a context for that work and many useful insights for the reader. Researchers, and possibly also practitioners, will find it well worth reading. (Amelia Regan, Computing Reviews, May, 2014) The main purpose of this book is to describe several aspects of combinatorial search algorithms and systems in a unified manner. ... The book is well written and will be useful for researchers and graduate students in computer science, operations research, and applied mathematics. (Petrica Pop, Computing Reviews, January, 2014)
The book deals with combinatorial search algorithms for NP-hard problems, focusing on knowledge sharing in combinatorial search. ... The diversity and originality of the proposed methods could be helpful for researchers, practitioner and graduate students working in optimization, search, and computational complexity. (Smaranda Belciug, zbMATH 1317.68003, 2015) The focus of this book is knowledge sharing in combinatorial search, a topic that is of considerable current importance in the quest for solutions to NP-hard problems. ... This is an exceptionally well-written book, which, while primarily presenting the author's own research, also provides a context for that work and many useful insights for the reader. Researchers, and possibly also practitioners, will find it well worth reading. (Amelia Regan, Computing Reviews, May, 2014) The main purpose of this book is to describe several aspects of combinatorial search algorithms and systems in a unified manner. ... The book is well written and will be useful for researchers and graduate students in computer science, operations research, and applied mathematics. (Petrica Pop, Computing Reviews, January, 2014)
Author Information
Dr. Youssef Hamadi is the head of the Constraint Reasoning Group at Microsoft Research Cambridge, and his research interests include combinatorial optimization in alternative frameworks (parallel and distributed architectures); the application of machine learning to search; autonomous search; and parallel propositional satisfiability.
