Introduction To Algorithms.
Material type: TextPublication details: Ashland : Arcler Press, (c)2019.Description: 1 online resource (252 pages)Content type:- text
- computer
- online resource
- 9781773616179
- QA76 .I587 2019
- COPYRIGHT NOT covered - Click this link to request copyright permission: https://lib.ciu.edu/copyright-request-form
Item type | Current library | Collection | Call number | URL | Status | Date due | Barcode | |
---|---|---|---|---|---|---|---|---|
Online Book (LOGIN USING YOUR MY CIU LOGIN AND PASSWORD) | G. Allen Fleece Library ONLINE | Non-fiction | QA76.9.43 (Browse shelf(Opens below)) | Link to resource | Available | on1085182255 |
Includes bibliographies and index.
Cover; Half Page Title; Page Title; Copyright Page; About the Author; Table of Contents; List of Figures; List of Tables; Preface; Chapter 1 Fundamentals of Algorithms; 1.1. Introduction; 1.2. Different Types of Problems Solved by Algorithms; 1.3. Data Structures; 1.4. Algorithms as a Technology; 1.5. Algorithms and Other Technologies; 1.6. Getting Started With Algorithm; 1.7. Analyzing Algorithms; References; Chapter 2 Classification of Algorithms; 2.1. Introduction; 2.2. Deterministic And Randomized Algorithms; 2.3. Online vs. Offline Algorithms
2.4. Exact, Approximate, Heuristic, And Operational Algorithms2.5. Classification According To The Main Concept; References; Chapter 3 An Introduction to Heuristic Algorithms; 3.1. Introduction; 3.2. Algorithms And Complexity; 3.3. Heuristic Techniques; 3.4. Evolutionary Algorithms; 3.5. Support Vector Machines; 3.6. Current Trends; References; Chapter 4 Types of Machine Learning Algorithms; 4.1. Introduction; 4.2. Supervised Learning Approach; 4.3. Unsupervised Learning; 4.4. Algorithm Types; References; Chapter 5 Approximation Algorithms; 5.1. Introduction; 5.2. Approximation Strategies
5.3. The Greedy Method5.4. Sequential Algorithms; 5.5. Randomization; 5.6. A Tour Of Approximation Classes; 5.7. Brief Introduction To PCPs; 5.8. Promising Application Areas For Approximation and Randomized Algorithms; 5.9. Tricks Of The Trade; References; Chapter 6 Comparative Investigation Of Exact Algorithms For 2D Strip Packing Problem; 6.1. Introduction; 6.2. The Upper Bound; 6.3. Lower Bounds For 2SP; 6.4. A Greedy Heuristic For Solving The 2D Knapsack Problems; 6.5. The Branch And Price Algorithms; 6.6. The Dichotomous Algorithm; 6.7. Computational Results; References
Chapter 7 Governance of Algorithms7.1. Introduction; 7.2. Analytical Framework; 7.3. Governance Options By Risks; References; Chapter 8 Limitations of Algorithmic Governance Options; 8.1. Introduction; 8.2. Limitations of Market Solutions And Self-Help Strategies; 8.3. Limitations of Self-Regulation And Self-Organization; 8.4. Limitations of State Intervention; References; Index
COPYRIGHT NOT covered - Click this link to request copyright permission:
There are no comments on this title.