소장자료

>>
소장자료
>
000 camMu
001 2210080852495
003 OCoLC
005 20190103135240
006 m d
007 cr cnu---unuuu
008 180908s2018 xx o 000 0 eng d
019 a1050606289
020 a9781789612479q(electronic bk.)
020 a1789612470q(electronic bk.)
035 a1881490b(NT)
035 a(OCoLC)1051139474z(OCoLC)1050606289
037 a90BE397B-A8BA-44BC-BAFF-42176798DA15bOverDrive, Inc.nhttp://www.overdrive.com
040 aEBLCPbengcEBLCPdNLEdTEFODdYDXdNd221008
050 aTA347.A78
072 aCOMx0000002bisacsh
082 a006.3223
100 aPatel, Devangini.
245 00 aHands-On Artificial Intelligence for Searchh[electronic resource] :bBuilding Intelligent Applications and Perform Enterprise Searches /cDevangini Patel.
260 aBirmingham :bPackt Publishing Ltd,c2018.
300 a1 online resource (120 p.)
500 00 aDescription based upon print version of record.
505 aCover; Title Page; Copyright and Credits; Packt Upsell; Contributors; Table of Contents; Preface; Chapter 1: Understanding the Depth-First Search Algorithm; Installing and setting up libraries; Setting up Python; Setting up Graphviz; Installing pip; Introduction to file searching applications; Basic search concepts; Formulating the search problem; Building trees with nodes; Stack data structure; The DFS algorithm; Recursive DFS; Do it yourself; Summary; Chapter 2: Understanding the Breadth-First Search Algorithm; Understanding the LinkedIn connection feature; Graph data structure
505 aQueue data structureThe BFS algorithm; BFS versus DFS; Order of traversal; Data structures; Memory; Optimal solution; Do it yourself; Summary; Chapter 3: Understanding the Heuristic Search Algorithm; Revisiting the navigation application; The priority queue data structure; Visualizing a search tree; Greedy BFS; A* Search; What is a good heuristic function? ; Properties of a good heuristic function; Admissible; Consistent; Summary; Other Books You May Enjoy; Index
520 aIn this book, you will understand what artificial intelligence is. It explains in detail basic search methods: Depth-First Search (DFS), Breadth-First Search (BFS), and A* Search, which can be used to make intelligent decisions when the initial state, end state, and possible actions are known. Random solutions or greedy solutions can be found ...
590 aMaster record variable field(s) change: 050, 072, 082, 650
650 aComputersxExpert Systems.2bisacsh
650 aComputersxWebxSearch Engines.2bisacsh
650 aInternet searching.2bicssc
650 aExpert systems / knowledge-based systems.2bicssc
650 aComputersxComputer Science.2bisacsh
650 aComputer science.2bicssc
650 aArtificial intelligence.
650 aApplication softwarexDevelopment.
650 aMachine learning.
650 aPython (Computer program language)
650 aCOMPUTERS / General.2bisacsh
655 aElectronic books.
776 iPrint version:aPatel, DevanginitHands-On Artificial Intelligence for Search : Building Intelligent Applications and Perform Enterprise SearchesdBirmingham : Packt Publishing Ltd,c2018z9781789611151
856 3EBSCOhostuhttp://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=1881490
938 aEBL - Ebook LibrarybEBLBnEBL5504934
938 aYBP Library ServicesbYANKn15681492
938 aEBSCOhostbEBSCn1881490
994 a92bN
Hands-On Artificial Intelligence for Search[electronic resource] :Building Intelligent Applications and Perform Enterprise Searches /Devangini Patel
종류
전자책
서명
Hands-On Artificial Intelligence for Search[electronic resource] :Building Intelligent Applications and Perform Enterprise Searches /Devangini Patel
저자명
발행사항
Birmingham : Packt Publishing Ltd 2018.
형태사항
1 online resource (120 p)
주기사항
Description based upon print version of record. / In this book, you will understand what artificial intelligence is. It explains in detail basic search methods: Depth-First Search (DFS), Breadth-First Search (BFS), and A* Search, which can be used to make intelligent decisions when the initial state, end state, and possible actions are known. Random solutions or greedy solutions can be found ...
관련 URL

소장정보

도서예약
서가부재도서 신고
보존서고신청
캠퍼스대출
우선정리신청
검색지인쇄
등록번호 청구기호 별치기호 소장위치 대출상태 반납예정일 서비스
전자자료는 소장사항이 존재하지 않습니다

책소개

전체 메뉴 보기