Analysis of Uninformed Search Methods
|
|
- Beverly Gilmore
- 6 years ago
- Views:
Transcription
1 nalysis of Uninformed earch Methods rian. Williams ep 21 st, 2004 lides adapted from: Tomas Lozano Perez, Russell and Norvig IM rian Williams, Fall 04 1
2 ssignments Remember: Problem et #2: imple cheme and earch due Monday, eptember 27th, Reading: Uninformed search: more of IM h. 3 rian Williams, Fall 04 2
3 Outline Recap nalysis epth-first search readth-first search Iterative deepening rian Williams, Fall 04 3
4 omplex missions must carefully: Plan complex sequences of actions chedule tight resources Monitor and diagnose behavior Repair or reconfigure hardware. Most I problems, like these, may be formulated as state space search. rian Williams, Fall 04 4
5 Problem olving: Formulate raph and Find Paths Formulate oal Formulate Problem tates oose rain stronaut Fox rain stronaut oose Fox stronaut oose rain Fox stronaut Fox oose rain stronaut oose rain Fox Operators enerate olution stronaut oose rain Fox rain Fox stronaut rain Fox oose stronaut oose equence of states stronaut oose oose stronaut Fox rain rain Fox stronaut oose rain Fox oose rain Fox oose Fox Fox stronaut oose Fox stronaut rain stronaut stronaut rain stronaut oose rain rain oose Fox rian Williams, Fall 04 5
6 Elements of lgorithm esign escription: (last Wednesday) stylized pseudo code, sufficient to analyze and implement the algorithm Implementation (last Monday). rian Williams, Fall 04 6
7 epth First earch (F) epth-first: dd path extensions to front of Q Pick first element of Q readth First earch (F) readth-first: dd path extensions to back of Q Pick first element of Q rian Williams, Fall 04 7
8 Issue: tarting at and moving top to bottom, will depth-first search ever reach? rian Williams, Fall 04 8
9 epth-first Effort can be wasted in more mild cases Q 3 1 () 2 ( ) ( ) 3 ( ) ( ) ( ) ( ) ( ) ( )( ) 5 ( ) 6 ( )( ) visited multiple times Multiple paths to, & How much wasted effort can be incurred in the worst case? rian Williams, Fall 04 9
10 How o We void Repeat Visits? Idea: Keep track of nodes already visited. o not place visited nodes on Q. oes this maintain correctness? ny goal reachable from a node that was visited a second time would be reachable from that node the first time. oes it always improve efficiency? Visits only a subset of the original paths, such that each node appears at most once at the head of a path in Q. rian Williams, Fall 04 10
11 How o We Modify imple earch lgorithm Let Q be a list of partial paths, Let be the start node and Let be the oal node. 1. Initialize Q with partial path () as only entry; 2. If Q is empty, fail. Else, pick some partial path N from Q 3. If head(n) =, return N (goal reached!) 4. Else a) Remove N from Q b) Find all children of head(n) and create all the one-step extensions of N to each child. c) dd to Q all the extended paths; d) o to step 2. rian Williams, Fall 04 11
12 imple earch lgorithm Let Q be a list of partial paths, Let be the start node and Let be the oal node. 1. Initialize Q with partial path () as only entry; set Visited = ( ) 2. If Q is empty, fail. Else, pick some partial path N from Q 3. If head(n) =, return N (goal reached!) 4. Else a) Remove N from Q b) Find all children of head(n) not in Visited and create all the one-step extensions of N to each child. c) dd to Q all the extended paths; d) dd children of head(n) to Visited e) o to step 2. rian Williams, Fall 04 12
13 Note: Testing for the oal lgorithm stops (in step 3) when head(n) =. ould have performed test in step 6, as each extended path is added to Q. ut, performing test in step 6 will be incorrect for optimal search, discussed later. We chose step 3 to maintain uniformity with these future searches. rian Williams, Fall 04 13
14 Outline nalysis epth-first search readth-first search Iterative deepening rian Williams, Fall 04 14
15 Elements of lgorithm esign escription: (last Wednesday) stylized pseudo code, sufficient to analyze and implement the algorithm Implementation (last Monday). nalysis: (today) oundness: when a solution is returned, is it guaranteed to be correct? ompleteness: is the algorithm guaranteed to find a solution when there is one? Time complexity: how long does it take to find a solution? pace complexity: how much memory does it need to perform search? rian Williams, Fall 04 15
16 haracterizing earch lgorithms Level 0 Level 1 b = 3 d = 1 m = 2 Level 2 b = maximum branching factor, number of children d = depth of the shallowest goal node m = maximum length of any path in the state space rian Williams, Fall 04 16
17 ost and Performance Which is better, depth-first or breadth-first? earch hortest uaranteed to Method Time pace Path? find path? epth-first readth-first case time is proportional to number of nodes visited case space is proportional to maximal length of Q rian Williams, Fall 04 17
18 ase Time for epth-first case time T is proportional to number of nodes visited Level 0 Level 1 Level 2 Level m 1 b*1 b*b... b*b m-1 T dfs = [b m + b + 1]*c dfs b * T dfs = [b m+1 + b m + b]*c dfs where cdfs is time per node olve recurrence [b 1] * T dfs = [b m+1 1]*c dfs T dfs = [b m+1 1] / [b 1] *c dfs rian Williams, Fall 04 18
19 ost Using Order Notation case time T is proportional to number of nodes visited Level 0 Level 1 Level 2 1 b*1 b*b... b*b m-1 Order Notation T = O(e) if T c * e for some constant c T dfs = [b m +1 1] / [b 1] *c dfs = O(b m+1 ) ~ O(b m ) for large b rian Williams, Fall 04 19
20 ost and Performance Which is better, depth-first or breadth-first? earch hortest uaranteed to Method Time pace Path? find path? epth-first ~ b m readth-first case time is proportional to number of nodes visited case space is proportional to maximal length of Q rian Williams, Fall 04 20
21 ase pace for epth-first Level 0 case space dfs is proportional to maximal length of Q Level 1 Level m rian Williams, Fall 04 21
22 ase pace for epth-first Level 0 case space dfs is proportional to maximal length of Q Level 1 Level m b-1 b-1... b If a node is queued its parent and siblings have been queued, and its parent dequeued. dfs [(b-1)*m+1] *c dfs where cdfs is space per node The children of at most one sibling is expanded at each level. dfs = [(b-1)*m+1] *c dfs dfs = O(b*m) rian Williams, Fall 04 22
23 ost and Performance Which is better, depth-first or breadth-first? earch hortest uaranteed to Method Time pace Path? find path? epth-first ~b m b*m readth-first case time is proportional to number of nodes visited case space is proportional to maximal length of Q rian Williams, Fall 04 23
24 ost and Performance Which is better, depth-first or breadth-first? earch hortest uaranteed to Method Time pace Path? find path? epth-first ~b m b*m No readth-first case time is proportional to number of nodes visited case space is proportional to maximal length of Q rian Williams, Fall 04 24
25 ost and Performance Which is better, depth-first or breadth-first? earch hortest uaranteed to Method Time pace Path? find path? epth-first ~b m b*m No Yes for finite graph readth-first case time is proportional to number of nodes visited case space is proportional to maximal length of Q rian Williams, Fall 04 25
26 ost and Performance Which is better, depth-first or breadth-first? earch hortest uaranteed to Method Time pace Path? find path? epth-first ~b m b*m No Yes for finite graph readth-first case time is proportional to number of nodes visited case space is proportional to maximal length of Q rian Williams, Fall 04 26
27 Level 0 ase Time for readth-first case time T is proportional to number of nodes visited Level 1 Level d Level d+1 Level m... onsider case where solution is at level d: rian Williams, Fall 04 27
28 ase Time for readth-first case time T is proportional to number of nodes visited Level 0 Level 1 Level d Level d+1 Level m... onsider case where solution is at level d: 1 b... b d b d+1 -b T bfs = [b d+1 + b d + b b]*c bfs ~ O(b d+1 ) for large b rian Williams, Fall 04 28
29 ost and Performance Which is better, depth-first or breadth-first? earch hortest uaranteed to Method Time pace Path? find path? epth-first ~b m b*m No Yes for finite graph readth-first ~b d+1 case time is proportional to number of nodes visited case space is proportional to maximal length of Q rian Williams, Fall 04 29
30 Level 0 ase pace for readth-first case space dfs is proportional to maximal length of Q Level 1 Level d Level d+1 rian Williams, Fall 04 30
31 ase pace for readth-first case space dfs is proportional to maximal length of Q Level 0 Level 1 Level d Level d+1 1 b... b d b d+1 -b bfs = [b d+1 - b + 1]*c bfs = O(b d+1 ) rian Williams, Fall 04 31
32 ost and Performance Which is better, depth-first or breadth-first? earch hortest uaranteed to Method Time pace Path? find path? epth-first ~b m b*m No Yes for finite graph readth-first ~b d+1 b d+1 case time is proportional to number of nodes visited case space is proportional to maximal length of Q rian Williams, Fall 04 32
33 readth-first Finds hortest Path Level 0 Level 1 Level d Level d+1 Nodes visited earlier can t include First reached ssuming each edge is length 1, other paths to must be at least as long as first found rian Williams, Fall 04 33
34 ost and Performance Which is better, depth-first or breadth-first? earch hortest uaranteed to Method Time pace Path? find path? epth-first ~b m b*m No Yes for finite graph readth-first ~b d+1 b d+1 Yes unit lngth case time is proportional to number of nodes visited case space is proportional to maximal length of Q rian Williams, Fall 04 34
35 ost and Performance Which is better, depth-first or breadth-first? earch hortest uaranteed to Method Time pace Path? find path? epth-first ~b m b*m No Yes for finite graph readth-first ~b d+1 b d+1 Yes unit lngth Yes case time is proportional to number of nodes visited case space is proportional to maximal length of Q rian Williams, Fall 04 35
36 The of The Which is better, depth-first or breadth-first? ssume d = m in the worst case, and call both m. Take the conservative estimate: b m+ 1 = O(b m +1) earch Method Time pace hortest Path? uaranteed to find path? epth-first b m+1 b*m No Yes for finite graph readth-first b m+1 b m Yes unit lngth Yes case time is proportional to number of nodes visited case space is proportional to maximal length of Q rian Williams, Fall 04 36
37 For best first search, which runs out first time or memory? rowth for est First earch b = 10; 10,000 nodes/sec; 1000 bytes/node epth Nodes Time Memory 2 1, seconds 1 megabyte 4 111, seconds 106 megabytes minutes 10 gigabytes hours 1 terabyte days 101 terabytes years 10 petabytes ,523 years 1 exabyte rian Williams, Fall 04 37
38 How o We et The est of oth Worlds? earch hortest uaranteed to Method Time pace Path? find path? epth-first ~b m b*m No Yes for finite graph readth-first ~b d+1 b d+1 Yes unit lngth Yes case time is proportional to number of nodes visited case space is proportional to maximal length of Q rian Williams, Fall 04 38
39 Outline nalysis Iterative deepening rian Williams, Fall 04 39
40 Iterative eepening (I) Idea: Explore tree in breadth-first order, using depth-first search. earch tree to depth 1,. Level 0 Level 1 Level 2 Level 3 rian Williams, Fall 04 40
41 Iterative eepening (I) Idea: Explore tree in breadth-first order, using depth-first search. earch tree to depth 1, then 2,. Level 0 Level 1 Level 2 Level 3 rian Williams, Fall 04 41
42 Iterative eepening (I) Idea: Explore tree in breadth-first order, using depth-first search. earch tree to depth 1, then 2, then 3. Level 0 Level 1 Level 2 Level 3 rian Williams, Fall 04 42
43 peed of Iterative eepening Level 0 Level 1 Level 2 d+1 d*b... 2*b d-1 Level d 1*b d ompare speed of F vs I: T bfs = 1+b + b b d + (b d+1 b) = O(b d+2 ) T ids = (d + 1)1 + (d)b + (d - 1)b b d = O(b d+1 ) Iterative deepening performs better than breadth-first! rian Williams, Fall 04 43
44 ummary Most problem solving tasks may be encoded as state space search. asic data structures for search are graphs and search trees. epth-first and breadth-first search may be framed, among others, as instances of a generic search strategy. ycle detection is required to achieve efficiency and completeness. omplexity analysis shows that breadth-first is preferred in terms of optimality and time, while depth-first is preferred in terms of space. Iterative deepening draws the best from depth-first and breadth-first search. rian Williams, Fall 04 44
Problem Solving as State Space Search
Problem olving as tate pace earch rian. Williams 6.070 pril 5 th, 00 lides adapted from: 6.0 Tomas Lozano Perez, Russell and Norvig IM rian Williams, pring 0 elf-iagnosing Explorers courtesy of JPL rian
More informationArtificial Intelligence Methods. Problem solving by searching
rtificial Intelligence Methods Problem solving by searching In which we see how an agent can find a sequence of actions that achieves its goals, when no single action will do. Dr. Igor Trajkovski Dr. Igor
More informationProblem solving and search. Chapter 3. Chapter 3 1
Problem solving and search Chapter 3 Chapter 3 1 eminders ssignment 0 due 5pm today ssignment 1 posted, due 2/9 Section 105 will move to 9-10am starting next week Chapter 3 2 Problem-solving agents Problem
More informationD1 Discrete Mathematics The Travelling Salesperson problem. The Nearest Neighbour Algorithm The Lower Bound Algorithm The Tour Improvement Algorithm
1 iscrete Mathematics The Travelling Salesperson problem The Nearest Neighbour lgorithm The Lower ound lgorithm The Tour Improvement lgorithm The Travelling Salesperson: Typically a travelling salesperson
More informationDivide-and-Conquer Algorithms Part Two
Divide-and-Conquer Algorithms Part Two Recap from Last Time Divide-and-Conquer Algorithms A divide-and-conquer algorithm is one that works as follows: (Divide) Split the input apart into multiple smaller
More informationSoundness and Completeness of State Space Search. Assignments
7/2/11 Soundness and Completeness of State Space Search Sertac Karaman 16.410 13 Sept 20 th, 2010 1 Assignments Remember: Problem Set #2: Uninformed search Out last Wednesday, Due this Wednesday, September
More informationInformed Search. Chap. 4. Breadth First. O(Min(N,B L )) BFS. Search. have same cost BIBFS. Bi- Direction. O(Min(N,2B L/2 )) BFS. have same cost UCS
Informed Search Chap. 4 Material in part from http://www.cs.cmu.edu/~awm/tutorials Uninformed Search Complexity N = Total number of states B = Average number of successors (branching factor) L = Length
More informationInformed Search. Day 3 of Search. Chap. 4, Russel & Norvig. Material in part from
Informed Search Day 3 of Search Chap. 4, Russel & Norvig Material in part from http://www.cs.cmu.edu/~awm/tutorials Uninformed Search Complexity N = Total number of states B = Average number of successors
More informationCSCE 750 Final Exam Answer Key Wednesday December 7, 2005
CSCE 750 Final Exam Answer Key Wednesday December 7, 2005 Do all problems. Put your answers on blank paper or in a test booklet. There are 00 points total in the exam. You have 80 minutes. Please note
More informationAI Programming CS S-06 Heuristic Search
AI Programming CS662-2013S-06 Heuristic Search David Galles Department of Computer Science University of San Francisco 06-0: Overview Heuristic Search - exploiting knowledge about the problem Heuristic
More informationTree of Life iological Sequence nalysis Chapter http://tolweb.org/tree/ Phylogenetic Prediction ll organisms on Earth have a common ancestor. ll species are related. The relationship is called a phylogeny
More information6.01: Introduction to EECS I. Optimizing a Search
6.0: Introduction to CS I Optimizing a Search May 3, 0 Nano-Quiz Makeups Wednesday, May 4, 6-pm, 34-50. everyone can makeup/retake NQ everyone can makeup/retake two additional NQs you can makeup/retake
More information8: Splay Trees. Move-to-Front Heuristic. Splaying. Splay(12) CSE326 Spring April 16, Search for Pebbles: Move found item to front of list
: Splay Trees SE Spring 00 pril, 00 Move-to-Front Heuristic Search for ebbles: Fred Wilma ebbles ino Fred Wilma ino ebbles Move found item to front of list Frequently searched items will move to start
More informationName: UW CSE 473 Final Exam, Fall 2014
P1 P6 Instructions Please answer clearly and succinctly. If an explanation is requested, think carefully before writing. Points may be removed for rambling answers. If a question is unclear or ambiguous,
More informationLearning Decision Trees
Learning Decision Trees Machine Learning Fall 2018 Some slides from Tom Mitchell, Dan Roth and others 1 Key issues in machine learning Modeling How to formulate your problem as a machine learning problem?
More informationGraph Search Howie Choset
Graph Search Howie Choset 16-11 Outline Overview of Search Techniques A* Search Graphs Collection of Edges and Nodes (Vertices) A tree Grids Stacks and Queues Stack: First in, Last out (FILO) Queue: First
More informationLearning Decision Trees
Learning Decision Trees Machine Learning Spring 2018 1 This lecture: Learning Decision Trees 1. Representation: What are decision trees? 2. Algorithm: Learning decision trees The ID3 algorithm: A greedy
More informationAutomata-based Verification - III
COMP30172: Advanced Algorithms Automata-based Verification - III Howard Barringer Room KB2.20: email: howard.barringer@manchester.ac.uk March 2009 Third Topic Infinite Word Automata Motivation Büchi Automata
More informationChapter 8 The Disjoint Sets Class
Chapter 8 The Disjoint Sets Class 2 Introduction equivalence problem can be solved fairly simply simple data structure each function requires only a few lines of code two operations: and can be implemented
More informationCS 662 Sample Midterm
Name: 1 True/False, plus corrections CS 662 Sample Midterm 35 pts, 5 pts each Each of the following statements is either true or false. If it is true, mark it true. If it is false, correct the statement
More informationSources: The Data Compression Book, 2 nd Ed., Mark Nelson and Jean-Loup Gailly.
Lossless ompression Multimedia Systems (Module 2 Lesson 2) Summary: daptive oding daptive Huffman oding Sibling Property Update lgorithm rithmetic oding oding and ecoding Issues: OF problem, Zero frequency
More informationDeterministic Planning and State-space Search. Erez Karpas
Planning and Search IE&M Technion to our Problem-solving agents Restricted form of general agent def Simple-Problem-Solving-Agent (problem): state, some description of the current world state seq, an action
More informationUninformed Search Lecture 4
Lecture 4 Wht re common serch strtegies tht operte given only serch problem? How do they compre? 1 Agend A quick refresher DFS, BFS, ID-DFS, UCS Unifiction! 2 Serch Problem Formlism Defined vi the following
More informationPriority queues implemented via heaps
Priority queues implemented via heaps Comp Sci 1575 Data s Outline 1 2 3 Outline 1 2 3 Priority queue: most important first Recall: queue is FIFO A normal queue data structure will not implement a priority
More informationSampling Rejection Sampling Importance Sampling Markov Chain Monte Carlo. Sampling Methods. Machine Learning. Torsten Möller.
Sampling Methods Machine Learning orsten Möller Möller/Mori 1 Recall Inference or General Graphs Junction tree algorithm is an exact inference method for arbitrary graphs A particular tree structure defined
More informationDecision Trees. CS 341 Lectures 8/9 Dan Sheldon
Decision rees CS 341 Lectures 8/9 Dan Sheldon Review: Linear Methods Y! So far, we ve looked at linear methods! Linear regression! Fit a line/plane/hyperplane X 2 X 1! Logistic regression! Decision boundary
More informationAutomata-based Verification - III
CS3172: Advanced Algorithms Automata-based Verification - III Howard Barringer Room KB2.20/22: email: howard.barringer@manchester.ac.uk March 2005 Third Topic Infinite Word Automata Motivation Büchi Automata
More informationSOLVING INTEGER LINEAR PROGRAMS. 1. Solving the LP relaxation. 2. How to deal with fractional solutions?
SOLVING INTEGER LINEAR PROGRAMS 1. Solving the LP relaxation. 2. How to deal with fractional solutions? Integer Linear Program: Example max x 1 2x 2 0.5x 3 0.2x 4 x 5 +0.6x 6 s.t. x 1 +2x 2 1 x 1 + x 2
More informationSampling Methods. Bishop PRML Ch. 11. Alireza Ghane. Sampling Rejection Sampling Importance Sampling Markov Chain Monte Carlo
Sampling Methods Bishop PRML h. 11 Alireza Ghane Sampling Methods A. Ghane /. Möller / G. Mori 1 Recall Inference or General Graphs Junction tree algorithm is an exact inference method for arbitrary graphs
More informationDATA Search I 魏忠钰. 复旦大学大数据学院 School of Data Science, Fudan University. March 7 th, 2018
DATA620006 魏忠钰 Serch I Mrch 7 th, 2018 Outline Serch Problems Uninformed Serch Depth-First Serch Bredth-First Serch Uniform-Cost Serch Rel world tsk - Pc-mn Serch problems A serch problem consists of:
More informationUndirected Graphical Models 4 Bayesian Networks and Markov Networks. Bayesian Networks to Markov Networks
Undirected Graphical Models 4 ayesian Networks and Markov Networks 1 ayesian Networks to Markov Networks 2 1 Ns to MNs X Y Z Ns can represent independence constraints that MN cannot MNs can represent independence
More informationPrinciples of AI Planning
Principles of 5. Planning as search: progression and regression Malte Helmert and Bernhard Nebel Albert-Ludwigs-Universität Freiburg May 4th, 2010 Planning as (classical) search Introduction Classification
More informationCS 4700: Foundations of Artificial Intelligence Homework 2 Solutions. Graph. You can get to the same single state through multiple paths.
CS 4700: Foundations of Artificial Intelligence Homework Solutions 1. (30 points) Imagine you have a state space where a state is represented by a tuple of three positive integers (i,j,k), and you have
More informationExam EDAF May Thore Husfeldt
Exam EDAF05 29 May 13 Thore Husfeldt Instructions What to bring. You can bring any written aid you want. This includes the course book and a dictionary. In fact, these two things are the only aids that
More informationDecision Trees Part 1. Rao Vemuri University of California, Davis
Decision Trees Part 1 Rao Vemuri University of California, Davis Overview What is a Decision Tree Sample Decision Trees How to Construct a Decision Tree Problems with Decision Trees Classification Vs Regression
More informationCS 4100 // artificial intelligence. Recap/midterm review!
CS 4100 // artificial intelligence instructor: byron wallace Recap/midterm review! Attribution: many of these slides are modified versions of those distributed with the UC Berkeley CS188 materials Thanks
More informationLars Schmidt-Thieme, Information Systems and Machine Learning Lab (ISMLL), University of Hildesheim, Germany
Syllabus Fri. 21.10. (1) 0. Introduction A. Supervised Learning: Linear Models & Fundamentals Fri. 27.10. (2) A.1 Linear Regression Fri. 3.11. (3) A.2 Linear Classification Fri. 10.11. (4) A.3 Regularization
More informationDirected Graphs (Digraphs) and Graphs
Directed Graphs (Digraphs) and Graphs Definitions Graph ADT Traversal algorithms DFS Lecturer: Georgy Gimel farb COMPSCI 220 Algorithms and Data Structures 1 / 74 1 Basic definitions 2 Digraph Representation
More informationPrinciples of AI Planning
Principles of AI Planning 5. Planning as search: progression and regression Albert-Ludwigs-Universität Freiburg Bernhard Nebel and Robert Mattmüller October 30th, 2013 Introduction Classification Planning
More informationSpeculative Parallelism in Cilk++
Speculative Parallelism in Cilk++ Ruben Perez & Gregory Malecha MIT May 11, 2010 Ruben Perez & Gregory Malecha (MIT) Speculative Parallelism in Cilk++ May 11, 2010 1 / 33 Parallelizing Embarrassingly Parallel
More informationSkylines. Yufei Tao. ITEE University of Queensland. INFS4205/7205, Uni of Queensland
Yufei Tao ITEE University of Queensland Today we will discuss problems closely related to the topic of multi-criteria optimization, where one aims to identify objects that strike a good balance often optimal
More informationPart V. Matchings. Matching. 19 Augmenting Paths for Matchings. 18 Bipartite Matching via Flows
Matching Input: undirected graph G = (V, E). M E is a matching if each node appears in at most one Part V edge in M. Maximum Matching: find a matching of maximum cardinality Matchings Ernst Mayr, Harald
More informationComputational Complexity
Computational Complexity S. V. N. Vishwanathan, Pinar Yanardag January 8, 016 1 Computational Complexity: What, Why, and How? Intuitively an algorithm is a well defined computational procedure that takes
More informationAVL Trees. Manolis Koubarakis. Data Structures and Programming Techniques
AVL Trees Manolis Koubarakis 1 AVL Trees We will now introduce AVL trees that have the property that they are kept almost balanced but not completely balanced. In this way we have O(log n) search time
More informationActivity Planning II: Plan Extraction and Analysis. Assignments
Activity Planning II: Plan Extraction and Analysis Slides draw upon material from: Prof. Maria Fox Univ Strathclyde, Scotland Brian C. Williams 16.410-13 October 4 th, 2010 Assignments Remember: Problem
More informationCS 188 Introduction to Fall 2007 Artificial Intelligence Midterm
NAME: SID#: Login: Sec: 1 CS 188 Introduction to Fall 2007 Artificial Intelligence Midterm You have 80 minutes. The exam is closed book, closed notes except a one-page crib sheet, basic calculators only.
More informationECS 120 Lesson 23 The Class P
ECS 120 Lesson 23 The Class P Oliver Kreylos Wednesday, May 23th, 2001 We saw last time how to analyze the time complexity of Turing Machines, and how to classify languages into complexity classes. We
More informationInference in Bayesian networks
Inference in Bayesian networks AIMA2e hapter 14.4 5 1 Outline Exact inference by enumeration Exact inference by variable elimination Approximate inference by stochastic simulation Approximate inference
More informationIntroduction to Arti Intelligence
Introduction to Arti Intelligence cial Lecture 4: Constraint satisfaction problems 1 / 48 Constraint satisfaction problems: Today Exploiting the representation of a state to accelerate search. Backtracking.
More informationMethods for finding optimal configurations
S 2710 oundations of I Lecture 7 Methods for finding optimal configurations Milos Hauskrecht milos@pitt.edu 5329 Sennott Square S 2710 oundations of I Search for the optimal configuration onstrain satisfaction
More information2 GRAPH AND NETWORK OPTIMIZATION. E. Amaldi Introduction to Operations Research Politecnico Milano 1
2 GRAPH AND NETWORK OPTIMIZATION E. Amaldi Introduction to Operations Research Politecnico Milano 1 A variety of decision-making problems can be formulated in terms of graphs and networks Examples: - transportation
More informationMath Models of OR: Branch-and-Bound
Math Models of OR: Branch-and-Bound John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 12180 USA November 2018 Mitchell Branch-and-Bound 1 / 15 Branch-and-Bound Outline 1 Branch-and-Bound
More informationEquivalence Checking of Sequential Circuits
Equivalence Checking of Sequential Circuits Sanjit Seshia EECS UC Berkeley With thanks to K. Keutzer, R. Rutenbar 1 Today s Lecture What we know: How to check two combinational circuits for equivalence
More information1 Showing Recognizability
CSCC63 Worksheet Recognizability and Decidability 1 1 Showing Recognizability 1.1 An Example - take 1 Let Σ be an alphabet. L = { M M is a T M and L(M) }, i.e., that M accepts some string from Σ. Prove
More informationIs the equal branch length model a parsimony model?
Table 1: n approximation of the probability of data patterns on the tree shown in figure?? made by dropping terms that do not have the minimal exponent for p. Terms that were dropped are shown in red;
More informationIntroduction. Decision Tree Learning. Outline. Decision Tree 9/7/2017. Decision Tree Definition
Introduction Decision Tree Learning Practical methods for inductive inference Approximating discrete-valued functions Robust to noisy data and capable of learning disjunctive expression ID3 earch a completely
More informationCS 331: Artificial Intelligence Local Search 1. Tough real-world problems
S 331: rtificial Intelligence Local Search 1 1 Tough real-world problems Suppose you had to solve VLSI layout problems (minimize distance between components, unused space, etc.) Or schedule airlines Or
More informationAdvanced topic: Space complexity
Advanced topic: Space complexity CSCI 3130 Formal Languages and Automata Theory Siu On CHAN Chinese University of Hong Kong Fall 2016 1/28 Review: time complexity We have looked at how long it takes to
More informationCPSC 320 Sample Final Examination December 2013
CPSC 320 Sample Final Examination December 2013 [10] 1. Answer each of the following questions with true or false. Give a short justification for each of your answers. [5] a. 6 n O(5 n ) lim n + This is
More informationScalar Optimisation Part 1
calar Optimisation Part 1 Michael O Boyle January, 2014 1 Course tructure L1 Introduction and Recap 4/5 lectures on classical optimisation 2 lectures on scalar optimisation Today example optimisations
More informationConstraint Satisfaction Problems
Constraint Satisfaction Problems Chapter 5 AIMA2e Slides, Stuart Russell and Peter Norvig, Completed by Kazim Fouladi, Fall 2008 Chapter 5 1 Outline CSP examples Backtracking search for CSPs Problem structure
More informationBayes Nets III: Inference
1 Hal Daumé III (me@hal3.name) Bayes Nets III: Inference Hal Daumé III Computer Science University of Maryland me@hal3.name CS 421: Introduction to Artificial Intelligence 10 Apr 2012 Many slides courtesy
More informationCSC 411 Lecture 3: Decision Trees
CSC 411 Lecture 3: Decision Trees Roger Grosse, Amir-massoud Farahmand, and Juan Carrasquilla University of Toronto UofT CSC 411: 03-Decision Trees 1 / 33 Today Decision Trees Simple but powerful learning
More informationLecture 6 January 15, 2014
Advanced Graph Algorithms Jan-Apr 2014 Lecture 6 January 15, 2014 Lecturer: Saket Sourah Scrie: Prafullkumar P Tale 1 Overview In the last lecture we defined simple tree decomposition and stated that for
More informationCSE 105 THEORY OF COMPUTATION
CSE 105 THEORY OF COMPUTATION Spring 2016 http://cseweb.ucsd.edu/classes/sp16/cse105-ab/ Today's learning goals Sipser Ch 1.4 Give an example of a non-regular language Outline two strategies for proving
More informationBayes Networks. CS540 Bryan R Gibson University of Wisconsin-Madison. Slides adapted from those used by Prof. Jerry Zhu, CS540-1
Bayes Networks CS540 Bryan R Gibson University of Wisconsin-Madison Slides adapted from those used by Prof. Jerry Zhu, CS540-1 1 / 59 Outline Joint Probability: great for inference, terrible to obtain
More informationLocal Probability Models
Readings: K&F 3.4, 5.~5.5 Local Probability Models Lecture 3 pr 4, 2 SE 55, Statistical Methods, Spring 2 Instructor: Su-In Lee University of Washington, Seattle Outline Last time onditional parameterization
More informationExact Inference: Variable Elimination
Readings: K&F 9.2 9. 9.4 9.5 Exact nerence: Variable Elimination ecture 6-7 Apr 1/18 2011 E 515 tatistical Methods pring 2011 nstructor: u-n ee University o Washington eattle et s revisit the tudent Network
More informationSampling Rejection Sampling Importance Sampling Markov Chain Monte Carlo. Sampling Methods. Oliver Schulte - CMPT 419/726. Bishop PRML Ch.
Sampling Methods Oliver Schulte - CMP 419/726 Bishop PRML Ch. 11 Recall Inference or General Graphs Junction tree algorithm is an exact inference method for arbitrary graphs A particular tree structure
More informationTuring Machines. 22c:135 Theory of Computation. Tape of a Turing Machine (TM) TM versus FA, PDA
Turing Machines A Turing machine is similar to a finite automaton with supply of unlimited memory. A Turing machine can do everything that any computing device can do. There exist problems that even a
More informationData Structures and Algorithms CMPSC 465
ata Structures and Algorithms MPS LTUR ellman-ford Shortest Paths Algorithm etecting Negative ost ycles Adam Smith // A. Smith; based on slides by K. Wayne,. Leiserson,. emaine L. Negative Weight dges
More informationCMPSCI611: The Matroid Theorem Lecture 5
CMPSCI611: The Matroid Theorem Lecture 5 We first review our definitions: A subset system is a set E together with a set of subsets of E, called I, such that I is closed under inclusion. This means that
More informationAlpha-Beta Pruning: Algorithm and Analysis
Alpha-Beta Pruning: Algorithm and Analysis Tsan-sheng Hsu tshsu@iis.sinica.edu.tw http://www.iis.sinica.edu.tw/~tshsu 1 Introduction Alpha-beta pruning is the standard searching procedure used for solving
More informationCS360 Homework 12 Solution
CS360 Homework 12 Solution Constraint Satisfaction 1) Consider the following constraint satisfaction problem with variables x, y and z, each with domain {1, 2, 3}, and constraints C 1 and C 2, defined
More informationCS 6375 Machine Learning
CS 6375 Machine Learning Decision Trees Instructor: Yang Liu 1 Supervised Classifier X 1 X 2. X M Ref class label 2 1 Three variables: Attribute 1: Hair = {blond, dark} Attribute 2: Height = {tall, short}
More informationCS60007 Algorithm Design and Analysis 2018 Assignment 1
CS60007 Algorithm Design and Analysis 2018 Assignment 1 Palash Dey and Swagato Sanyal Indian Institute of Technology, Kharagpur Please submit the solutions of the problems 6, 11, 12 and 13 (written in
More informationQuestion Paper Code :
www.vidyarthiplus.com Reg. No. : B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2011. Time : Three hours Fourth Semester Computer Science and Engineering CS 2251 DESIGN AND ANALYSIS OF ALGORITHMS (Regulation
More informationDijkstra s Single Source Shortest Path Algorithm. Andreas Klappenecker
Dijkstra s Single Source Shortest Path Algorithm Andreas Klappenecker Single Source Shortest Path Given: a directed or undirected graph G = (V,E) a source node s in V a weight function w: E -> R. Goal:
More informationAdministrative notes. Computational Thinking ct.cs.ubc.ca
Administrative notes Labs this week: project time. Remember, you need to pass the project in order to pass the course! (See course syllabus.) Clicker grades should be on-line now Administrative notes March
More informationAlpha-Beta Pruning: Algorithm and Analysis
Alpha-Beta Pruning: Algorithm and Analysis Tsan-sheng Hsu tshsu@iis.sinica.edu.tw http://www.iis.sinica.edu.tw/~tshsu 1 Introduction Alpha-beta pruning is the standard searching procedure used for 2-person
More informationDecision Trees. Gavin Brown
Decision Trees Gavin Brown Every Learning Method has Limitations Linear model? KNN? SVM? Explain your decisions Sometimes we need interpretable results from our techniques. How do you explain the above
More informationEquivalence Relations. Equivalence Classes. A new question. Building Equivalence Classes. CSE 326: Data Structures Disjoint Union/Find
Equivalence Relations CE : Data tructures Disjoint Union/Find Relation R : For every pair of elements (a, b) in a set, a R b is either true or false If a R b is true, then a is related to b An equivalence
More informationBreadth First Search, Dijkstra s Algorithm for Shortest Paths
CS 374: Algorithms & Models of Computation, Spring 2017 Breadth First Search, Dijkstra s Algorithm for Shortest Paths Lecture 17 March 1, 2017 Chandra Chekuri (UIUC) CS374 1 Spring 2017 1 / 42 Part I Breadth
More informationCSE613: Parallel Programming, Spring 2012 Date: May 11. Final Exam. ( 11:15 AM 1:45 PM : 150 Minutes )
CSE613: Parallel Programming, Spring 2012 Date: May 11 Final Exam ( 11:15 AM 1:45 PM : 150 Minutes ) This exam will account for either 10% or 20% of your overall grade depending on your relative performance
More informationCS221 Practice Midterm
CS221 Practice Midterm Autumn 2012 1 ther Midterms The following pages are excerpts from similar classes midterms. The content is similar to what we ve been covering this quarter, so that it should be
More informationPrelim 2[Solutions] Solutions. 1. Short Answer [18 pts]
Prelim [Solutions]. Short Answer [8 pts] (a) [3 pts] In a model/view/controller, Swing is likely to be part of (there may be more than one): i. the model ii. the view iii. the controller The view and the
More informationLecture 3: Decision Trees
Lecture 3: Decision Trees Cognitive Systems - Machine Learning Part I: Basic Approaches of Concept Learning ID3, Information Gain, Overfitting, Pruning last change November 26, 2014 Ute Schmid (CogSys,
More informationMarkov Decision Processes
Markov Decision Processes Lecture notes for the course Games on Graphs B. Srivathsan Chennai Mathematical Institute, India 1 Markov Chains We will define Markov chains in a manner that will be useful to
More informationQuestion of the Day. Machine Learning 2D1431. Decision Tree for PlayTennis. Outline. Lecture 4: Decision Tree Learning
Question of the Day Machine Learning 2D1431 How can you make the following equation true by drawing only one straight line? 5 + 5 + 5 = 550 Lecture 4: Decision Tree Learning Outline Decision Tree for PlayTennis
More informationUsing first-order logic, formalize the following knowledge:
Probabilistic Artificial Intelligence Final Exam Feb 2, 2016 Time limit: 120 minutes Number of pages: 19 Total points: 100 You can use the back of the pages if you run out of space. Collaboration on the
More informationCSE 591 Foundations of Algorithms Homework 4 Sample Solution Outlines. Problem 1
CSE 591 Foundations of Algorithms Homework 4 Sample Solution Outlines Problem 1 (a) Consider the situation in the figure, every edge has the same weight and V = n = 2k + 2. Easy to check, every simple
More informationMock Exam Künstliche Intelligenz-1. Different problems test different skills and knowledge, so do not get stuck on one problem.
Name: Matriculation Number: Mock Exam Künstliche Intelligenz-1 January 9., 2017 You have one hour(sharp) for the test; Write the solutions to the sheet. The estimated time for solving this exam is 53 minutes,
More informationDepartment of Electrical and Computer Engineering University of Wisconsin Madison. Fall Midterm Examination CLOSED BOOK
Department of Electrical and Computer Engineering University of Wisconsin Madison ECE 553: Testing and Testable Design of Digital Systems Fall 203-204 Midterm Examination CLOSED OOK Kewal K. Saluja Date:
More informationCS213d Data Structures and Algorithms
CS21d Data Structures and Algorithms Heaps and their Applications Milind Sohoni IIT Bombay and IIT Dharwad March 22, 2017 1 / 18 What did I see today? March 22, 2017 2 / 18 Heap-Trees A tree T of height
More informationMidterm 2 V1. Introduction to Artificial Intelligence. CS 188 Spring 2015
S 88 Spring 205 Introduction to rtificial Intelligence Midterm 2 V ˆ You have approximately 2 hours and 50 minutes. ˆ The exam is closed book, closed calculator, and closed notes except your one-page crib
More informationGame Engineering CS F-12 Artificial Intelligence
Game Engineering CS420-2011F-12 Artificial Intelligence David Galles Department of Computer Science University of San Francisco 12-0: Artifical Intelligence AI in games is a huge field Creating a believable
More informationTime Complexity (1) CSCI Spring Original Slides were written by Dr. Frederick W Maier. CSCI 2670 Time Complexity (1)
Time Complexity (1) CSCI 2670 Original Slides were written by Dr. Frederick W Maier Spring 2014 Time Complexity So far we ve dealt with determining whether or not a problem is decidable. But even if it
More informationTuring Machine Variants. Sipser pages
Turing Machine Variants Sipser pages 148-154 Marking symbols It is often convenient to have the Turing machine leave a symbol on the tape but to mark it in some way 1 1 0 2 B B B B B B B State = 1 1 1
More informationIntelligent Agents. Formal Characteristics of Planning. Ute Schmid. Cognitive Systems, Applied Computer Science, Bamberg University
Intelligent Agents Formal Characteristics of Planning Ute Schmid Cognitive Systems, Applied Computer Science, Bamberg University Extensions to the slides for chapter 3 of Dana Nau with contributions by
More informationMessage Passing Algorithms and Junction Tree Algorithms
Message Passing lgorithms and Junction Tree lgorithms Le Song Machine Learning II: dvanced Topics S 8803ML, Spring 2012 Inference in raphical Models eneral form of the inference problem P X 1,, X n Ψ(
More information