| Description |
1 online resource (xiii, 191 pages) : illustrations |
| Series |
Computer science, technology and applications |
|
Computer science, technology and applications
|
| Contents |
COMPUTER SEARCH ALGORITHMS ; COMPUTER SEARCH ALGORITHMS ; CONTENTS ; PREFACE ; LIVE SOFT-MATTER QUANTUM COMPUTING ; ABSTRACT ; INTRODUCTION ; EVOLUTIONARY TRANSITIONS, CONFLICT MEDIATION, AND QUANTUM MECHANICS; QUANTUM CELL BIOLOGY AND CELLULAR DECISION MAKING ; MICROBIAL INTELLIGENCES AND LIVE, SOFT MATTER QUANTUM COMPUTING; DIRECTIONS FOR FUTURE RESEARCH AND DEVELOPMENT OF BIOTECHNOLOGIES ; CONCLUSION ; ACKNOWLEDGMENTS; REFERENCES ; STUDYING DIFFERENT HEURISTIC SEARCHES TO SOLVE A REAL-WORLD FREQUENCY ASSIGNMENT PROBLEM; ABSTRACT ; INTRODUCTION |
|
THE FREQUENCY PLANNING PROBLEM IN GSM NETWORKS Mathematical Description ; HEURISTIC SEARCHES INCLUDED IN OUR STUDY ; The Genetic Algorithm ; The Scatter Search Heuristic ; The Population Based Incremental Learning ; The Greedy Randomized Adaptive Search Procedure ; EXPERIMENTAL EVALUATION AND RESULTS ; Empirical Results ; CONCLUSION AND FUTURE WORK ; ACKNOWLEDGMENTS ; REFERENCES ; EMERGENCE AND ADVANCES OF QUANTUM SEARCH; BACKGROUND ; AN INTRODUCTION TO QUANTUM COMPUTATION ; Quantum Search Algorithm ; A Quantum Oracle ; Grover's Search Algorithm ; Optimality of Grover's Algorithm |
|
CONTINUOUS TIME SEARCH ALGORITHM Uses of Grover's Search Algorithm ; Hardware Implementation ; CONCLUSION; ACKNOWLEDGMENTS ; REFERENCES ; EFFICIENT IMPLEMENTATIONS OF BI-LEVEL PROGRAMMING METHODS FOR CONTINUOUS NETWORK DESIGN PROBLEMS ; ABSTRACT; 1. INTRODUCTION ; 2. BI-LEVEL PROGRAMMING PROBLEM (BLPP) FORMULATION FOR ENDP ; 3. SOLUTION ALGORITHMS ; 3.1. Rosen's Gradient Projection Method ; 3.2. Conjugate Gradient Projection Method ; 3.3. Quasi-Newton Projection Method: Algorithm of BFGS ; 3.4. Rosen's Gradient Projection Method with PARTAN ; 4. COMPUTATIONAL RESULTS |
|
CONCLUSIONS AND DISCUSSIONS ACKNOWLEDGMENTS ; REFERENCES ; A HYBRID INTELLIGENT TECHNIQUE COMBINES NEURAL NETWORKS AND TABU SEARCH METHODS FOR FORECASTING ; ABSTRACT ; 1. INTRODUCTION ; 2. ARTIFICIAL NEURAL NETWORKS ; 3. THE HYBRID INTELLIGENT TECHNIQUE FOR FORECASTING ; 3.1. The Tabu Search Algorithm ; 3.2. The Hybrid Intelligent Method for Forecasting ; 4. IMPLEMENTATION ; CONCLUSION ; REFERENCES; LU_HANCOCK: A BEST FIRST SEARCH TO PROCESS SINGLE-DESTINATION MULTIPLE-ORIGIN ROUTE QUERY IN A GRAPH ; ABSTRACT ; INTRODUCTION ; RELATED WORK |
|
LU: A BEST FIRST SEARCH ALGORITHM TO PROCESS SOMDR QUERIES IN A GRAPHAlgorithm ; Admissibility and Optimality ; LU_HANCOCK: THE REVERSE LU TO PROCESS SDMOR QUERIES IN A GRAPH; Algorithm ; Admissibility and Optimality ; The Pseudo Code ; EXPERIMENT AND RESULT ANALYSIS ; Performance Measures ; RESULTS ; CONCLUSION ; REFERENCES; SOME HEURISTIC APPROACHES FOR SOLVING NON-CONVEX OPTIMIZATION PROBLEMS; Abstract; 1. Introduction; 2. Stochastic methods for solving continuous non-convex optimization problems; 2.1. Simulated annealing; 2.1.1. Metropolis algorithm and simulated annealing |
| Bibliography |
Includes bibliographical references and index |
| Notes |
Print version record |
| Subject |
Computer algorithms.
|
|
Querying (Computer science)
|
|
Database searching.
|
|
Algorithms
|
|
algorithms.
|
|
online searching.
|
|
COMPUTERS -- Database Management -- General.
|
|
COMPUTERS -- Desktop Applications -- Databases.
|
|
COMPUTERS -- System Administration -- Storage & Retrieval.
|
|
Computer algorithms
|
|
Database searching
|
|
Querying (Computer science)
|
| Form |
Electronic book
|
| Author |
Salander, Elisabeth C
|
| ISBN |
9781612090436 |
|
1612090435 |
|
