Computer and Information Science » Numerical Analysis and Scientific Computing

Search Algorithms and Applications

Edited by Nashat Mansour, ISBN 978-953-307-156-5, 504 pages, Publisher: InTech, Chapters published April 26, 2011 under CC BY-NC-SA 3.0 license
DOI: 10.5772/620

Search algorithms aim to find solutions or objects with specified properties and constraints in a large solution search space or among a collection of objects. A solution can be a set of value assignments to variables that will satisfy the constraints or a sub-structure of a given discrete structure. In addition, there are search algorithms, mostly probabilistic, that are designed for the prospective quantum computer. This book demonstrates the wide applicability of search algorithms for the purpose of developing useful and practical solutions to problems that arise in a variety of problem domains. Although it is targeted to a wide group of readers: researchers, graduate students, and practitioners, it does not offer an exhaustive coverage of search algorithms and applications. The chapters are organized into three parts: Population-based and quantum search algorithms, Search algorithms for image and video processing, and Search algorithms for engineering applications.

Prof. Nashat Mansour

Nashat Mansour is a Professor of Computer Science at the Lebanese American University. He received B.E. and M.Eng.Sc. degrees in Electrical Engineering from the University of New South Wales, Australia, and M.S. in Computer Engineering and Ph.D. in Computer Science from Syracuse University, USA. His research interests include: application of metaheuristics and data mining to real-world problems, software testing, parallel computing, protein structure prediction, and gene-disease association. Dr. Mansour has published many papers in international journals and conference proceedings.

Edited Books

  • Search Algorithms and Applications

    Search algorithms aim to find solutions or objects with specified properties and constraints in a large solution search space or among a collection of objects. A solution can be a set of value assignments to variables that will satisfy the constraints or a sub-structure of a given discrete structure. In addition, there are search algorithms, mostly probabilistic, that are designed for the prospective quantum computer. This book demonstrates the wide applicability of search algorithms for the purpose of developing useful and practical solutions to problems that arise in a variety of problem domains. Although it is targeted to a wide group of readers: researchers, graduate students, and practitioners, it does not offer an exhaustive coverage of search algorithms and applications. The chapters are organized into three parts: Population-based and quantum search algorithms, Search algorithms for image and video processing, and Search algorithms for engineering applications.

Publications