• Title Search Algorithms and Applications
• Author(s) Nashat Mansour
• Publisher: IN-TECH (April, 2011)
• License(s): Attribution 3.0 Unported (CC BY 3.0)
• Hardcover 494 pages
• eBook HTML, PDF
• Language: English
• ISBN-10: N/A
• ISBN-13: 978-953-307-156-5
• Share This:  

Book Description

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.

• N/A

• Amazon

• Algorithms and Data Structures
• Operations Research (OR), Linear Programming, Optimization, and Approximation
• Computational and Algorithmic Mathematics
• Computational Complexity
• Discrete Mathematics

• Search Algorithms and Applications (Nashat Mansour)
• PDF Format
• The Mirror Site (1) - PDF

• Algorithms for Decision Making (Mykel Kochenderfer, et al)

  This textbook provides a broad introduction to algorithms for decision making under uncertainty, covering the underlying mathematical problem formulations and the algorithms for solving them.

• Search Algorithms for Engineering Optimization

  Heuristic Search is an important sub-discipline of optimization theory. This book explores a variety of applications for search methods and techniques in different fields of electrical engineering. By organizing relevant results and apps.

• Planning Algorithms (Steven M. LaValle)

  This is the only book for teaching and referencing of Planning Algorithms in applications including robotics, computational biology, computer graphics, manufacturing, aerospace applications and medicine, etc.

• Engineering Design Optimization (Joaquim R. Martins, et al)

  The philosophy of this book is to provide a detailed enough explanation and analysis of optimization methods so that readers can implement a basic working version. Practical tips are included for common issues encountered in practical engineering design optimization.

• Optimization for Engineering Systems (Ralph W. Pike)

  This book stands at the interface of mathematics and industrial applications of optimization. The topics were selected for their breadth of application to the optimization of engineering systems, especially continuous ones.

• Convex Optimization (Stephen Boyd, et al.)

  On recognizing convex optimization problems and then finding the most appropriate technique for solving them. It contains many worked examples in fields such as engineering, computer science, mathematics, statistics, finance, and economics.

• Global Optimization Algorithms - Theory and Application

  This book is devoted to global optimization algorithms, which are methods to find optimal solutions for given problems. It especially focuses on Evolutionary Computation by discussing evolutionary algorithms, genetic algorithms, Genetic Programming, etc.

• Knapsack Problems: Algorithms and Computer Implementations

  The text fully develops an algorithmic approach to Knapsack Problems without losing mathematical rigor. It provides a comprehensive overview of the methods for solving Knapsack Problems (KP), its variants and generalizations.

• Ant Colony Optimization - Techniques and Applications

  The book first describes the translation of observed ant behavior into working optimization algorithms. The Ant Colony Optimization is then introduced and viewed in the general context of combinatorial optimization.