Computer search algorithms
Author(s)
Bibliographic Information
Computer search algorithms
（Computer science, technology and applications）
Nova Science Publishers, c2011
Available at / 1 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references and index
Description and Table of Contents
Description
In computer science, a search algorithm, is an algorithm for finding an item with specified properties among a collection of items. The items may be stored individually as records in a database; or may be elements of a search space defined by a mathematical formula or procedure, such as the roots of an equation with integer variables; or a combination of the two, such as the Hamiltonian circuits of a graph. This book presents research data in the study of computer search algorithms, including live soft-matter quantum computing; heuristic searches applied to the resolution of a relevant optimisation problem from the telecommunications domain; the emergence and advances of quantum search algorithms; an equilibrium network design problem for road traffic network; artificial neural networks; and evolutionary algorithms based on the concept of stochastic schemata exploiter.
Table of Contents
- Preface
- Live Soft-Matter Quantum Computing
- Studying Different Heuristic Searches to Solve a Real-World Frequency Assignment Problem
- Emergence & Advances of Quantum Search
- Efficient Implementations of Bi-Level Programming Methods for Continuous Network Design Problems
- A Hybrid Intelligent Technique Combines Neural Networks & Tabu Search Methods for Forecasting
- Lu Hancock: A Best First Search to Process Single-Destination Multiple-Origin Route Query in a Graph
- Some Heuristic Approaches for Solving Non-Convex Optimization Problems
- Evolutionary Algorithm Based on Concept of Stochastic Schemata Exploiter
- Index.
by "Nielsen BookData"
