Searching Often we are not given an algorithm to solve a problem, - PowerPoint PPT Presentation

Aug 16, 2023 •137 likes •222 views

Searching Often we are not given an algorithm to solve a problem, but only a specification of what is a solution we have to search for a solution. Search is a way to implement dont know nondeterminism. So far we have seen how

Searching ➤ Often we are not given an algorithm to solve a problem, but only a specification of what is a solution — we have to search for a solution. ➤ Search is a way to implement don’t know nondeterminism. ➤ So far we have seen how to convert a semantic problem of finding logical consequence to a search problem of finding derivations. ☞ ☞
Search Graphs ➤ A graph consists of a set N of nodes and a set A of ordered pairs of nodes, called arcs . ➤ Node n 2 is a neighbor of n 1 if there is an arc from n 1 to n 2 . That is, if � n 1 , n 2 � ∈ A . ➤ A path is a sequence of nodes � n 0 , n 1 , . . . , n k � such that � n i − 1 , n i � ∈ A . ➤ Given a set of start nodes and goal nodes, a solution is a path from a start node to a goal node. ☞ ☞ ☞
Example Graph for the Delivery Robot r123 storage o125 o123 o119 l3d1 l3d2 l3d3 l2d1 l2d2 l2d4 l2d3 o109 mail ts o103 o111 ☞ ☞ ☞
Search Graph for SLD Resolution yes ← a ∧ d yes ← h ∧ d a ← b ∧ c . a ← g . yes ← b ∧ c ∧ d yes ← g ∧ d yes ← m ∧ d a ← h . b ← j . yes ← m ∧ d yes ← j ∧ c ∧ d b ← k . d ← m . yes ← f ∧ d yes ← k ∧ c ∧ d d ← p . f ← m . yes ← m ∧ d yes ← p ∧ d f ← p . g ← m . yes ← m ∧ c ∧ d yes ← d g ← f . k ← m . yes ← p yes ← m h ← m . p . yes ← ? a ∧ d ☞ ☞ ☞
Graph Searching ➤ Generic search algorithm: given a graph, start nodes, and goal nodes, incrementally explore paths from the start nodes. ➤ Maintain a frontier of paths from the start node that have been explored. ➤ As search proceeds, the frontier expands into the unexplored nodes until a goal node is encountered. ➤ The way in which the frontier is expanded defines the search strategy. ☞ ☞ ☞
Problem Solving by Graph Searching frontier start node explored nodes unexplored nodes ☞ ☞ ☞
Graph Search Algorithm Input: a graph, a set of start nodes, Boolean procedure goal ( n ) that tests if n is a goal node. frontier := {� s � : s is a start node } ; while frontier is not empty: select and remove path � n 0 , . . . , n k � from frontier ; if goal ( n k ) return � n 0 , . . . , n k � ; for every neighbor n of n k add � n 0 , . . . , n k , n � to frontier ; end while ☞ ☞ ☞
➤ We assume that after the search algorithm returns an answer, it can be asked for more answers and the procedure continues. ➤ Which value is selected from the frontier at each stage defines the search strategy. ➤ The neighbors defines the graph. ➤ is _ goal defines what is a solution. ☞ ☞

Recommend

Linguistics 384: Language and Computers Operators Searching the web Topic 2: Searching

Language and Computers Topic 2: Searching Introduction Text Speech Searching in a Library Catalogue Special characters Linguistics 384: Language and Computers Operators Searching the web Topic 2: Searching Operators Improving searching

597 views • 36 slides

Searching Tiziana Ligorio 1 Todays Plan Searching algorithms and their analysis 2

Searching Tiziana Ligorio 1 Todays Plan Searching algorithms and their analysis 2 Searching Looking for something! In this discussion we will assume searching for an element in an array 3 Linear search Most intuitive

269 views • 25 slides

Chapter 5 Searching and Binary Search Trees 5.1 Searching sequence The purpose of searching :

CS 2412 Data Structures Chapter 5 Searching and Binary Search Trees 5.1 Searching sequence The purpose of searching : find out some specific item from a collection of data. Key of information: some kind of index of items in the collection of

943 views • 69 slides

Searching and Sorting Mason Vail, Boise State University Computer Science Searching Searching is

Searching and Sorting Mason Vail, Boise State University Computer Science Searching Searching is the process of locating a target element in a collection or determining that it is not present by comparing the target to candidate elements in the

573 views • 18 slides

#3: Trademark Two Problems Eric R. Waltmire Searching Patent Attorney 1. Not Searching 2.

Mistakes to Avoid When Attempting To Protect Trademarks #3: Trademark Two Problems Eric R. Waltmire Searching Patent Attorney 1. Not Searching 2. Searching Common Law Burger King Facebook Problem Search Problem Problem The signatory

277 views • 5 slides

CS 162 Intro to Programming II Searching 1 Searching

CS 162 Intro to Programming II Searching 1 Searching Data is stored in various structures Typically it is organized on the type of data

419 views • 14 slides

Sorting and Searching Topic 11 Sorting and Searching S ti d S hi Fundamental problems in

Sorting and Searching Topic 11 Sorting and Searching S ti d S hi Fundamental problems in computer science and programming "There's nothing in your head the There s nothing in your head the Sorting done to make searching easier

234 views • 12 slides

Sorting and Searching Topic 14 Searching and Simple Sorts Fundamental problems in computer

Sorting and Searching Topic 14 Searching and Simple Sorts Fundamental problems in computer science and programming "There's nothing in your head the Sorting done to make searching easier sorting hat can't see. So try me Multiple

350 views • 6 slides

Searching Consider the problem of searching an array for a given value Hashing If the

Searching Consider the problem of searching an array for a given value Hashing If the array is not sorted, the search requires O(n) time If the value isnt there, we need to search all n elements If the value is there, we

370 views • 6 slides

End-vertices of graph searching algorithms Graph searching algorithms Shou-Jun Xu ( M )

Report in Shanghai Shou-Jun Xu ( M ) End-vertices of graph searching algorithms Graph searching algorithms Shou-Jun Xu ( M ) Properties of end- vertcies E-mail:shjxu@lzu.edu.cn End-vertex Lanzhou University Problems @

609 views • 27 slides

Searching and Sorting The Millennium Challenge Problems Searching and Sorting Birch and

Eric Roberts Handout #62 CS 106A March 5, 2010 Searching and Sorting The Millennium Challenge Problems Searching and Sorting Birch and Swinnerton-Dyer Conjecture Hodge Conjecture Navier-Stokes Equations P vs NP Poincar Conjecture

275 views • 4 slides

CS 1501 www.cs.pitt.edu/~nlf4/cs1501/ Searching Review: Searching through a collection Given a

CS 1501 www.cs.pitt.edu/~nlf4/cs1501/ Searching Review: Searching through a collection Given a collection of keys C , how to we search for a given key k ? Store collection in an array Unsorted Sorted Linked list

662 views • 23 slides

CSN08101 Digital Forensics Lecture 3: Linux Searching Lecture 3: Linux Searching Module Leader:

CSN08101 Digital Forensics Lecture 3: Linux Searching Lecture 3: Linux Searching Module Leader: Dr Gordon Russell Lecturers: Robert Ludwiniak This week is all about: Finding files Searching files Understanding files

690 views • 52 slides

Hashing Searching Consider the problem of searching an array for a given value If the

Hashing Searching Consider the problem of searching an array for a given value If the array is not sorted, the search requires O(n) time If the value isnt there, we need to search all n elements If the value is there, we search

365 views • 24 slides

Searching in a Public Library Searching in a Public Library Some Experiences with the Search

Searching in a Public Library Searching in a Public Library Some Experiences with the Search Behaviour of Patrons of a Public Library At the public library in Waalre (NL) there is a dedicated catalogue system in operation now for 2 years. Alls

444 views • 30 slides

From Searching to Researching Three stages of digital scholarship

From Searching to Researching Three stages of digital scholarship Finding : we make catalogs and enable searching so that scholars can find the objects

565 views • 28 slides

How to Build an LM Good LMs need lots of n-grams! [Brants et al, 2007] Key function: map

How to Build an LM Good LMs need lots of n-grams! [Brants et al, 2007] Key function: map from n-grams to counts searching for the best 192593 searching for the right 45805 searching for the cheapest 44965 searching for the

595 views • 36 slides

Searching Sorting and Searching arrays Given an array of ints find the index of the

Topic 24 Searching Sorting and Searching arrays Given an array of ints find the index of the "There's nothing in your head first occurrence of a target int the sorting hat can't see. So try index 0 1 2 3 4 5 me on and I will tell

285 views • 5 slides

Advanced Algorithms COMS31900 Orthogonal Range Searching Rapha el Clifford Slides by

Advanced Algorithms COMS31900 Orthogonal Range Searching Rapha el Clifford Slides by Benjamin Sach Orthogonal range searching A 2D range searching data structure stores n distinct ( x, y ) -pairs and supports: the lookup ( x 1 , x 2 ,

2.2k views • 187 slides

Algorithm Analysis: Searching Fall 2013 Carola Wenk Searching A List A very common task is to

Algorithm Analysis: Searching Fall 2013 Carola Wenk Searching A List A very common task is to check whether an item is contained in a list. L: 2 5 1 0 8 6 -3 4 -1 ... Does L contain the number 6? 1. Define the problem (input, output)

601 views • 10 slides

Searching Searching Architecture Architecture Models Models for for Proactive Software

Searching Searching Architecture Architecture Models Models for for Proactive Software Diversification Proactive Software Diversification Benoit Baudry joint work with J. Bourcier, F. Fouquet, S. Allier, M. Monperrus 1 Early software

932 views • 57 slides

Graph Searching CSE 373 Data Structures Lecture 20 Readings Reading Sections 9.5 and

Graph Searching CSE 373 Data Structures Lecture 20 Readings Reading Sections 9.5 and 9.6 3/7/03 Graph Searching - Lecture 20 2 Graph Searching Find Properties of Graphs Spanning trees Connected components

585 views • 27 slides

Indexing and Searching Indexing and Searching Berlin Chen 2005 References: 1. Modern

Indexing and Searching Indexing and Searching Berlin Chen 2005 References: 1. Modern Information Retrieval, chapter 8 2. Information Retrieval: Data Structures & Algorithms, chapter 5 3. G.H. Gonnet, R.A. Baeza-Yates, T. Snider,

511 views • 37 slides

Searching Sequence databases 1: Searching Sequence databases 1: Blast Blast Query: Query:

Searching Sequence databases 1: Searching Sequence databases 1: Blast Blast Query: Query: >gi|26339572|dbj|BAC33457.1| unnamed protein product [Mus musculus] MSSTKLEDSLSRRNWSSASELNETQEPFLNPTDYDDEEFLRYLWREYLHPKEYEWVLIAGYIIVFVV

278 views • 8 slides