000			03405cam a2200385Ki 4500
001			on1085182255
003			OCoLC
005			20240726104806.0
008			190209s2019 xx o 000 0 eng d
040			_aEBLCP _beng _epn _erda _cEBLCP _dYDX _dOCLCQ _dLVT _dOCLCF _dOCLCQ _dNT _dOCLCQ _dUKAHL _dYDXIT
020			_a9781773616179 _q((electronic)l(electronic)ctronic)
050	0	4	_aQA76 _b.I587 2019
049			_aMAIN
100	1		_aFlejoles, Rex Porbasas. _e1
245	1	0	_aIntroduction To Algorithms.
260			_aAshland : _bArcler Press, _c(c)2019.
300			_a1 online resource (252 pages)
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_adata file _2rda
504			_a2
505	0	0	_aCover; 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
505	0	0	_a2.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
505	0	0	_a5.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
505	0	0	_aChapter 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
530			_a2 _ub
650		0	_aComputer algorithms.
650		0	_aComputer programming.
655		1	_aElectronic Books.
856	4	0	_zClick to access digital title | log in using your CIU ID number and my.ciu.edu password. _uhttpss://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=2013910&site=eds-live&custid=s3260518
942			_cOB _D _eEB _hQA.. _m2019 _QOL _R _x _8NFIC _2LOC
994			_a92 _bNT
999			_c78396 _d78396
902			_a1 _bCynthia Snell _c1 _dCynthia Snell