東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Algorithms = design techniques and a...

Alsuwaiyel, M. H.

FindBook

Google Book

Amazon

博客來

Algorithms = design techniques and analysis /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Algorithms/ M. H. Alsuwaiyel.
其他題名:	design techniques and analysis /
作者:	Alsuwaiyel, M. H.
出版者:	Singapore :World Scientific, : c2022.,
面頁冊數:	1 online resource (756 p.)
內容註:	Basic concepts in algorithmic analysis -- Data structures -- Heaps and the disjoint sets data structures -- Induction -- Divide and conquer -- Dynamic programming -- The greedy approach -- Graph traversal -- NP-complete problems -- Introduction to computational complexity -- Lower bounds -- Backtracking -- Randomized algorithms -- Approximation algorithms -- Network flow -- Matching -- Geometric sweeping -- Voronoi diagrams -- Parallel algorithms.
標題:	Algorithms - Textbooks. -
電子資源:	https://www.worldscientific.com/worldscibooks/10.1142/12324#t=toc
ISBN:	9789811238659

Algorithms = design techniques and analysis /
Alsuwaiyel, M. H.

Algorithmsdesign techniques and analysis /[electronic resource] :M. H. Alsuwaiyel. - 2nd ed. - Singapore :World Scientific,c2022. - 1 online resource (756 p.) - Lecture notes series on computing ;vol. 15. - Lecture notes series on computing ;vol. 15..

Includes bibliographical references and index.

Basic concepts in algorithmic analysis -- Data structures -- Heaps and the disjoint sets data structures -- Induction -- Divide and conquer -- Dynamic programming -- The greedy approach -- Graph traversal -- NP-complete problems -- Introduction to computational complexity -- Lower bounds -- Backtracking -- Randomized algorithms -- Approximation algorithms -- Network flow -- Matching -- Geometric sweeping -- Voronoi diagrams -- Parallel algorithms.

"Problem solving is an essential part of every scientific discipline. It has two components: (1) problem identification and formulation, and (2) the solution to the formulated problem. One can solve a problem on its own using ad hoc techniques or by following techniques that have produced efficient solutions to similar problems. This required the understanding of various algorithm design techniques, how and when to use them to formulate solutions, and the context appropriate for each of them. This book presents a design thinking approach to problem solving in computing - by first using algorithmic analysis to study the specifications of the problem, before mapping the problem on to data structures, then on to the situatable algorithms. Each technique or strategy is covered in its own chapter supported by numerous examples of problems and their algorithms. The new edition includes a comprehensive chapter on parallel algorithms, and many enhancements"--

Mode of access: World Wide Web.

ISBN: 9789811238659

LCCN: 2021038677Subjects--Topical Terms:

811678
Algorithms
--Textbooks.

LC Class. No.: QA9.58 / .A425 2022

Dewey Class. No.: 518/.1

Algorithms = design techniques and analysis /
LDR:02550cmm a2200349 a 4500 001 2311417
003 WSP
005 20211215030817.0
006 m o d
007 cr cnu---unuuu
008 230722s2022 si ob 001 0 eng d
010 $a 2021038677
020 $a 9789811238659 $q (ebook)
020 $a 9811238650 $q (ebook)
020 $z 9789811238642 $q (hbk.)
020 $z 9811238642 $q (hbk.)
035 $a 00012324
040 $a WSPC $b eng $c WSPC
041 0 $a eng
050 4 $a QA9.58 $b .A425 2022
082 0 4 $a 518/.1 $2 23
100 1 $a Alsuwaiyel, M. H. $3 877673
245 1 0 $a Algorithms $h [electronic resource] : $b design techniques and analysis / $c M. H. Alsuwaiyel.
250 $a 2nd ed.
260 $a Singapore : $b World Scientific, $c c2022.
300 $a 1 online resource (756 p.)
490 1 $a Lecture notes series on computing ; $v vol. 15
504 $a Includes bibliographical references and index.
505 0 $a Basic concepts in algorithmic analysis -- Data structures -- Heaps and the disjoint sets data structures -- Induction -- Divide and conquer -- Dynamic programming -- The greedy approach -- Graph traversal -- NP-complete problems -- Introduction to computational complexity -- Lower bounds -- Backtracking -- Randomized algorithms -- Approximation algorithms -- Network flow -- Matching -- Geometric sweeping -- Voronoi diagrams -- Parallel algorithms.
520 $a "Problem solving is an essential part of every scientific discipline. It has two components: (1) problem identification and formulation, and (2) the solution to the formulated problem. One can solve a problem on its own using ad hoc techniques or by following techniques that have produced efficient solutions to similar problems. This required the understanding of various algorithm design techniques, how and when to use them to formulate solutions, and the context appropriate for each of them. This book presents a design thinking approach to problem solving in computing - by first using algorithmic analysis to study the specifications of the problem, before mapping the problem on to data structures, then on to the situatable algorithms. Each technique or strategy is covered in its own chapter supported by numerous examples of problems and their algorithms. The new edition includes a comprehensive chapter on parallel algorithms, and many enhancements"-- $c Publisher's website.
538 $a Mode of access: World Wide Web.
538 $a System requirements: Adobe Acrobat Reader.
588 $a Description based on print version record.
650 0 $a Algorithms $v Textbooks. $3 811678
830 0 $a Lecture notes series on computing ; $v vol. 15. $3 3620962
856 4 0 $u https://www.worldscientific.com/worldscibooks/10.1142/12324#t=toc