# Uninformed search methods II.

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 CS 2710 Foundations of AI Lecture 4 Uninformed search methods II. Milos Hauskrecht 5329 Sennott Square Announcements Homework assignment 1 is out Due on Tuesday, September 12, 2017 before the lecture Report and programming part: Programming part involves Puzzle 8 problem. Assignment (programs and reports) must be done individually not collaboratively!!! Course web page: Homework submission: Electronic via CourseWeb Separate submission of the report and programs 1

2 Uninformed methods Uninformed search methods use only information available in the problem definition readth-first search (FS) Depth-first search (DFS) Iterative deepening (IDA) i-directional search For the minimum cost path problem: Uniform cost search Properties of breadth-first search Completeness: Yes. The solution is reached if it exists. Optimality: Yes, for the shortest path. Time complexity: O( b d ) exponential in the depth of the solution d Memory (space) complexity: O( b d ) nodes are kept in the memory 2

3 Properties of depth-first search Completeness: No. If infinite loops can occur. Solution 1: set the maximum depth limit m Solution 2: prevent occurrence of cycles Optimality: No. Solution found first may not be the shortest possible. Time complexity: O( b m ) exponential in the maximum depth of the search tree m Memory (space) complexity: O(bm) linear in the maximum depth of the search tree m Elimination of state repeats While searching the state space for the solution we can encounter the same state many times. Question: Is it necessary to keep and expand all copies of states in the search tree? Two possible cases: (A) Cyclic state repeats Search tree () Non-cyclic state repeats A A 3

4 Elimination of cycles A A Case A: Corresponds to the path with a cycle A branch of the tree representing a path with a cycle cannot be the part of the shortest solution and can be safely eliminated. Elimination of non-cyclic state repeats Root of the search tree node-1 node-2 A state is reached by a longer than optimal path than it cannot be the part of the shortest solution and can be safely eliminated. 4

5 Elimination of state repeats with FS Search tree A A readth FS is well behaved with regard to all state repeats: we can safely eliminate the node that is associated with the state that has been expanded before Elimination of state repeats with DFS Root of the search tree node-1 node-2 Caveat: The order of node expansion does not imply correct elimination strategy Solution: we need to remember the length of the path in order to safely eliminate any of the nodes 5

6 Limited-depth depth first search Put the limit (l) on the depth of the depth-first exploration The limit is set externally and may not cover the solution Limit l=2 l Not explored Time complexity: Memory complexity: O( b l ) O(bl) l - is a given limit Iterative deepening algorithm (IDA) ased on the idea of the limited-depth search, but It resolves the difficulty of knowing the depth limit ahead of time. Idea: try all depth limits in an increasing order. That is, search first with the depth limit l=0, then l=1, l=2, and so on until the solution is reached Iterative deepening combines advantages of the depth-first and breadth-first search with only moderate computational overhead 6

7 Iterative deepening algorithm (IDA) Progressively increases the limit of the limited-depth depthfirst search Limit 0 Limit 1 Limit 2 Iterative deepening Cutoff depth = 0 Fagaras Rimnicu Lugoj Vilcea 7

8 Iterative deepening Cutoff depth = 0 Fagaras Rimnicu Lugoj Vilcea Iterative deepening Cutoff depth = 1 Fagaras Rimnicu Lugoj Vilcea 8

9 Iterative deepening Cutoff depth = 1 Fagaras Rimnicu Lugoj Vilcea Iterative deepening Cutoff depth = 1 Fagaras Rimnicu Lugoj Vilcea 9

10 Iterative deepening Cutoff depth = 1 Fagaras Rimnicu Lugoj Vilcea Iterative deepening Cutoff depth = 1 Fagaras Rimnicu Lugoj Vilcea 10

11 Iterative deepening Cutoff depth = 2 Fagaras Rimnicu Lugoj Vilcea Iterative deepening Cutoff depth = 2 Fagaras Rimnicu Lugoj Vilcea 11

12 Iterative deepening Cutoff depth = 2 Fagaras Rimnicu Lugoj Vilcea Iterative deepening Cutoff depth = 2 Fagaras Rimnicu Lugoj Vilcea 12

13 Iterative deepening Cutoff depth = 2 Fagaras Rimnicu Lugoj Vilcea Iterative deepening Cutoff depth = 2 Fagaras Rimnicu Lugoj Vilcea 13

14 Completeness:? Properties of IDA Optimality:? Time complexity:? Memory (space) complexity:? Properties of IDA Completeness: Yes. The solution is reached if it exists. (the same as FS when limit is always increased by 1) Optimality: Time complexity:? Memory (space) complexity:? 14

15 Properties of IDA Completeness: Yes. The solution is reached if it exists. (the same as FS when limit is always increased by 1) Optimality: Yes, for the shortest path. (the same as FS) Time complexity:? Memory (space) complexity:? IDA time complexity Level 0 Level 1 Level 2 Level d d O (1) O (b) O ( b 2 ) O( b d ) O( b d ) 15

16 Properties of IDA Completeness: Yes. The solution is reached if it exists. (the same as FS) Optimality: Yes, for the shortest path. (the same as FS) Time complexity: 2 d O(1) O( b ) O( b ) O( b ) O( b exponential in the depth of the solution d worse than FS, but asymptotically the same Memory (space) complexity:? 1 d ) IDA memory complexity Level 0 Level 1 Level 2 Level d d O (1) O (b) O ( 2b) O(db) O(db) 16

17 Properties of IDA Completeness: Yes. The solution is reached if it exists. (the same as FS) Optimality: Yes, for the shortest path. (the same as FS) Time complexity: 2 d O(1) O( b ) O( b ) O( b ) O( b exponential in the depth of the solution d worse than FS, but asymptotically the same Memory (space) complexity: O(db) 1 d much better than FS ) i-directional search In some search problems we want to find the path from the initial state to the unique goal state (e.g. traveler problem) i-directional search idea: Initial state Goal state Search both from the initial state and the goal state; Use inverse operators for the goal-initiated search. 17

18 i-directional search Why bidirectional search? What is the benefit? Assume FS.? Initial state Goal state i-directional search Why bidirectional search? What is the benefit? Assume FS. Cuts the depth of the search space by half Initial state Goal state d/2 d/2 O(b d/2 ) Time and memory complexity 18

19 i-directional search Why bidirectional search? Assume FS. It cuts the depth of the search tree by half. Caveat: Merge the solutions. Initial state Goal state Equal? How? i-directional search Why bidirectional search? Assume FS. It cuts the depth of the search tree by half. Caveat: Merge the solutions. Initial state Goal state Equal? How? The hash structure remembers the side of the tree the state was expanded first time. If the same state is reached from other side we have a solution. 19

20 Minimum cost path search Traveler example with distances [km] Optimal path: the shortest distance path between the initial and destination city Searching for the minimum cost path General minimum cost path-search problem: adds weights or costs to operators (links) Search strategy: Intelligent expansion of the search tree should be driven by the cost of the current (partially) built path Implementation: Path cost function for node n : g(n) length of the path represented by the search tree branch starting at the root of the tree (initial state) to n Search strategy: Expand the leaf node with the minimum g(n) first Can be implemented by a priority queue 20

21 Searching for the minimum cost path The basic algorithm for finding the minimum cost path: Dijkstra s shortest path In AI, the strategy goes under the name Uniform cost search Note: When operator costs are all equal to 1 the uniform cost search is equivalent to the breadth first search FS Uniform cost search Expand the node with the minimum path cost first Implementation: a priority queue 0 queue g(n) 0 21

22 Uniform cost search queue g(n) Uniform cost search g(n) queue

23 Uniform cost search g(n) 0 queue Lugoj Lugoj Properties of the uniform cost search Completeness: assume that operator costs are non-negative? Optimality:? Time complexity:? Memory (space) complexity:? 23

24 Properties of the uniform cost search Completeness: Yes, assuming that operator costs are nonnegative (the cost of path never decreases) g( n) g(successor( n)) Optimality: Yes. Returns the least-cost path. Time complexity: number of nodes with the cost g(n) smaller than the optimal cost Memory (space) complexity: number of nodes with the cost g(n) smaller than the optimal cost Elimination of state repeats Idea: A node is redundant and can be eliminated if there is another node with exactly the same state and a shorter path from the initial state Root of the search tree g(node-1) =120 g(node-2) =95 node-2 node-1 24

25 Elimination of state repeats Idea: A node is redundant and can be eliminated if there is another node with exactly the same state and a shorter path from the initial state Root of the search tree g(node-1) =120 g(node-2) =95 node-2 node-1 Elimination of state repeats Idea: A node is redundant and can be eliminated if there is another node with exactly the same state and a shorter path from the initial state g(node-1) =120 g(node-2) =95 node-2 Root of the search tree Assuming positive costs: If the state has already been expanded, is there a shorter path to that node? node-1 25

26 Elimination of state repeats Idea: A node is redundant and can be eliminated if there is another node with exactly the same state and a shorter path from the initial state g(node-1) =120 g(node-2) =95 node-2 Assuming positive costs: If the state has already been expanded, is there a shorter path to that node? No! Implementation: Marking with the hash table Root of the search tree node-1 26

### Uninformed search methods II.

CS 1571 Introduction to AI Lecture 5 Uninformed search methods II. Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Uninformed methods Uninformed search methods use only information available in

### Uninformed search methods

Lecture 3 Uninformed search methods Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Announcements Homework 1 Access through the course web page http://www.cs.pitt.edu/~milos/courses/cs2710/ Two

### Uninformed search methods

Lecture 3 Uninformed search methods Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Announcements Homework assignment 1 is out Due on Tuesday, September 12, 2017 before the lecture Report and programming

### Artificial Intelligence. Uninformed Search Strategies

Artificial Intelligence Uninformed search strategies Uninformed Search Strategies Uninformed strategies use only the information available in the problem definition Also called Blind Search No info on

### Uninformed Search (Ch )

1 Uninformed Search (Ch. 3-3.4) 7 Small examples 8-Queens: how to fit 8 queens on a 8x8 board so no 2 queens can capture each other Two ways to model this: Incremental = each action is to add a queen to

### Problem Solving Agents

Problem Solving Agents A problem solving agent is one which decides what actions and states to consider in completing a goal Examples: Finding the shortest path from one city to another 8-puzzle Problem

### Princess Nora University Faculty of Computer & Information Systems ARTIFICIAL INTELLIGENCE (CS 370D) Computer Science Department

Princess Nora University Faculty of Computer & Information Systems 1 ARTIFICIAL INTELLIGENCE (CS 370D) Computer Science Department (CHAPTER-3-PART2) PROBLEM SOLVING AND SEARCH (Course coordinator) Searching

### CSE 3401: Intro to AI & LP Uninformed Search II

CSE 3401: Intro to AI & LP Uninformed Search II Required Readings: R & N Chapter 3, Sec. 1-4. 1 {Arad}, {Zerind, Timisoara, Sibiu}, {Zerind, Timisoara, Arad, Oradea, Fagaras, RimnicuVilcea }, {Zerind,

### Uninformed Search (Ch )

1 Uninformed Search (Ch. 3-3.4) 3 Terminology review State: a representation of a possible configuration of our problem Action: -how our agent interacts with the problem -can be different depending on

### Problem Solving as Search - I

Problem Solving as Search - I Shobhanjana Kalita Dept. of Computer Science & Engineering Tezpur University Slides prepared from Artificial Intelligence A Modern approach by Russell & Norvig Problem-Solving

### CENG 466 Artificial Intelligence. Lecture 4 Solving Problems by Searching (II)

CENG 466 Artificial Intelligence Lecture 4 Solving Problems by Searching (II) Topics Search Categories Breadth First Search Uniform Cost Search Depth First Search Depth Limited Search Iterative Deepening

### Uninformed Search Strategies

Uninformed Search Strategies Instructor: Dr. Wei Ding Fall 2010 1 Uninformed Search Strategies Also called blind search. Have no additional information about states beyond that provided in the problem

### Solving Problems by Searching chap3 1. Problem-Solving Agents

Chapter3 Solving Problems by Searching 20070315 chap3 1 Problem-Solving Agents Reflex agents cannot work well in those environments - state/action mapping too large - take too long to learn Problem-solving

### SEARCH SEARCH TREE. Node: State in state tree. Root node: Top of state tree

Page 1 Page 1 Page 2 SEARCH TREE SEARCH Node: State in state tree Root node: Top of state tree Children: Nodes that can be reached from a given node in 1 step (1 operator) Expanding: Generating the children

### CSE 3402: Intro to Artificial Intelligence Uninformed Search II

CSE 3402: Intro to Artificial Intelligence Uninformed Search II Required Readings: Chapter 3, Sec. 1-4. 1 {Arad}, {Zerind, Timisoara, Sibiu}, {Zerind, Timisoara, Arad, Oradea, Fagaras, RimnicuVilcea },

### Search I. Tuomas Sandholm Carnegie Mellon University Computer Science Department. [Read Russell & Norvig Chapter 3]

Search I Tuomas Sandholm Carnegie Mellon University Computer Science Department [Read Russell & Norvig Chapter 3] Search I Goal-based agent (problem solving agent) Goal formulation (from preferences).

### SEARCH TREE. Generating the children of a node

SEARCH TREE Node: State in state tree Root node: Top of state tree Children: Nodes that can be reached from a given node in 1 step (1 operator) Expanding: Generating the children of a node Open: Closed:

### Overview. Depth Limited Search. Depth Limited Search. COMP219: Artificial Intelligence. Lecture 8: Combining Search Strategies and Speeding Up

COMP219: Artificial Intelligence Lecture 8: Combining Search Strategies and Speeding Up Last time Basic problem solving techniques: Breadth-first search complete but expensive Depth-first search cheap

### COMP219: Artificial Intelligence. Lecture 8: Combining Search Strategies and Speeding Up

COMP219: Artificial Intelligence Lecture 8: Combining Search Strategies and Speeding Up 1 Overview Last time Basic problem solving techniques: Breadth-first search complete but expensive Depth-first search

### COMP9414: Artificial Intelligence Uninformed Search

COMP9, Monday March, 0 Uninformed Search COMP9: Artificial Intelligence Uninformed Search Overview Breadth-First Search Uniform Cost Search Wayne Wobcke Room J- wobcke@cse.unsw.edu.au Based on slides by

### Representation. Representation. Representation. Representation. 8 puzzle.

You have a 3-liter jug and a 4-liter jug, and need to measure out exactly two liters of water. the jugs do not have any measurement lines you don't have any additional containers 8 puzzle. Measuring water.

### Better Search Improved Uninformed Search CIS 32

Better Search Improved Uninformed Search CIS 32 Functionally PROJECT 1: Lunar Lander Game - Demo + Concept - Open-Ended: No One Solution - Menu of Point Options - Get Started NOW!!! - Demo After Spring

### Real World Search Problems. CS 331: Artificial Intelligence Uninformed Search. Simpler Search Problems. Example: Oregon. Search Problem Formulation

Real World Search Problems S 331: rtificial Intelligence Uninformed Search 1 2 Simpler Search Problems ssumptions bout Our Environment Fully Observable Deterministic Sequential Static Discrete Single-agent

### Introduction. AI and Searching. Simple Example. Simple Example. Now a Bit Harder. From Hammersmith to King s Cross

Introduction AI and Searching We have seen how models of the environment allow an intelligent agent to dry run scenarios in its head without the need to act Logic allows premises to be tested Machine learning

### Uninformed search strategies

AIMA sections 3.4,3.5 search use only the information available in the problem denition Breadth-rst search Uniform-cost search Depth-rst search Depth-limited search Iterative deepening search Breadth-rst

### CS 4649/7649 Robot Intelligence: Planning

CS 4649/7649 Robot Intelligence: Planning Heuristics & Search Sungmoon Joo School of Interactive Computing College of Computing Georgia Institute of Technology S. Joo (sungmoon.joo@cc.gatech.edu) 1 *Slides

### CSC384: Introduction to Artificial Intelligence. Search

CSC384: Introduction to Artificial Intelligence Search Chapter 3 of R&N 3 rd edition is very useful reading. Chapter 4 of R&N 3 rd edition is worth reading for enrichment. We ll touch upon some of the

### SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY :: PUTTUR (AUTONOMOUS) Siddharth Nagar, Narayanavanam Road QUESTION BANK (DESCRIPTIVE)

Subject with Code : Data Structures(16MC806) Course & Specialization: MCA UNIT I Sorting, Searching and Directories 1. Explain how to sort the elements by using insertion sort and derive time complexity

### 6.034 Artificial Intelligence

Massachusetts Institute of Technology 6.034 Artificial Intelligence Examination Solutions # 1 Problem 1 Enforcing the Rules on Wall Street (30 points) Part A (12 points) Worksheet Initial Database Joe

### Depth-bounded Discrepancy Search

Depth-bounded Discrepancy Search Toby Walsh* APES Group, Department of Computer Science University of Strathclyde, Glasgow Gl 1XL. Scotland tw@cs.strath.ac.uk Abstract Many search trees are impractically

### Transposition Table, History Heuristic, and other Search Enhancements

Transposition Table, History Heuristic, and other Search Enhancements Tsan-sheng Hsu tshsu@iis.sinica.edu.tw http://www.iis.sinica.edu.tw/~tshsu 1 Abstract Introduce heuristics for improving the efficiency

### /435 Artificial Intelligence Fall 2015

Final Exam 600.335/435 Artificial Intelligence Fall 2015 Name: Section (335/435): Instructions Please be sure to write both your name and section in the space above! Some questions will be exclusive to

### CS 4649/7649 Robot Intelligence: Planning

CS 4649/7649 Robot Intelligence: Planning Roadmap Approaches Sungmoon Joo School of Interactive Computing College of Computing Georgia Institute of Technology S. Joo (sungmoon.joo@cc.gatech.edu) 1 *Slides

### Application of Dijkstra s Algorithm in the Evacuation System Utilizing Exit Signs

Application of Dijkstra s Algorithm in the Evacuation System Utilizing Exit Signs Jehyun Cho a, Ghang Lee a, Jongsung Won a and Eunseo Ryu a a Dept. of Architectural Engineering, University of Yonsei,

### Decision Trees. Nicholas Ruozzi University of Texas at Dallas. Based on the slides of Vibhav Gogate and David Sontag

Decision Trees Nicholas Ruozzi University of Texas at Dallas Based on the slides of Vibhav Gogate and David Sontag Announcements Course TA: Hao Xiong Office hours: Friday 2pm-4pm in ECSS2.104A1 First homework

### G53CLP Constraint Logic Programming

G53CLP Constraint Logic Programming Dr Rong Qu Basic Search Strategies CP Techniques Constraint propagation* Basic search strategies Look back, look ahead Search orders B & B *So far what we ve seen is

### COLREGS Based Collision Avoidance of Unmanned Surface Vehicles

COLREGS Based Collision Avoidance of Unmanned Surface Vehicles Aug 2nd, 2017 Michael R. Benjamin Kyle Woerner, Michael Novitzky, John Leonard MIT Dept. of Mechanical Engineering Computer Science and Artificial

### COMP 406 Lecture 05. Artificial. Fiona Yan Liu Department of Computing The Hong Kong Polytechnic University

COMP 406 Lecture 05 Artificial Intelligence Fiona Yan Liu Department of Computing The Hong Kong Polytechnic University Learning Outcomes of Intelligent Agents Search agents Uninformed search Informed search

### Introduction to Algorithms

Introduction to Algorithms 6.46J/.4J LECTURE 7 Shortest Paths I Properties o shortest paths Dijkstra s Correctness Analysis Breadth-irst Paths in graphs Consider a digraph G = (V, E) with edge-weight unction

### Optimization and Search. Jim Tørresen Optimization and Search

Optimization and Search INF3490 - Biologically inspired computing Lecture 1: Marsland chapter 9.1, 9.4-9.6 2017 Optimization and Search Jim Tørresen 2 Optimization and Search Methods (selection) Optimization

### Incremental ARA*: An Anytime Incremental Search Algorithm For Moving Target Search. University of Southern California Singapore Management University

Incremental ARA*: An Anytime Incremental Search Algorithm For Moving Target Search Xiaoxun Sun Tansel Uras William Yeoh Sven Koenig University of Southern California Singapore Management University Moving

### CS Lecture 5. Vidroha debroy. Material adapted courtesy of Prof. Xiangnan Kong and Prof. Carolina Ruiz at Worcester Polytechnic Institute

CS 3353 Lecture 5 Vidroha debroy Material adapted courtesy of Prof. Xiangnan Kong and Prof. Carolina Ruiz at Worcester Polytechnic Institute Searching for a number Find a specific number 91-3 26 54 73

### Urban OR: Quiz 2 Solutions (2003) ( 1 ρ 1 )( 1 ρ 1 ρ 2 ) ( 1 12 )( ) σ S ] 24 [ 2 = 60, 2 2 ] ( 2 ) 3

Problem 1: (a) Wo = ƒ λ Urban OR: Quiz 2 Solutions (2003) 2 2 E [ S i ] 12 1 12 9 i = + = 1 min i = 1 2 60 2 60 2 W W = o 1 q1 = = 1. 25 min ( 1 ρ 1 ) ( 1 12 ) 60 W W = o 1 q2 = = 6. 25 min ( 1 ρ 1 )(

### Planning and Acting in Partially Observable Stochastic Domains

Planning and Acting in Partially Observable Stochastic Domains Leslie Pack Kaelbling and Michael L. Littman and Anthony R. Cassandra (1998). Planning and Acting in Partially Observable Stochastic Domains,

### CS 4649/7649 Robot Intelligence: Planning

CS 4649/7649 Robot Intelligence: Planning Partially Observable MDP Sungmoon Joo School of Interactive Computing College of Computing Georgia Institute of Technology S. Joo (sungmoon.joo@cc.gatech.edu)

### CS 4649/7649 Robot Intelligence: Planning

CS 4649/7649 Robot Intelligence: Planning Differential Kinematics, Probabilistic Roadmaps Sungmoon Joo School of Interactive Computing College of Computing Georgia Institute of Technology S. Joo (sungmoon.joo@cc.gatech.edu)

Advanced Search Hill climbing Yingyu Liang yliang@cs.wisc.edu Computer Sciences Department University of Wisconsin, Madison [Based on slides from Jerry Zhu, Andrew Moore http://www.cs.cmu.edu/~awm/tutorials

### CMSC131. Introduction to Computational Thinking. (with links to some external Scratch exercises) How do you accomplish a task?

CMSC131 Introduction to Computational Thinking (with links to some external Scratch exercises) How do you accomplish a task? When faced with a task, we often need to undertake several steps to accomplish

### Robust Task Execution: Procedural and Model-based. Outline. Desiderata: Robust Task-level Execution

Robust Task Execution: Procedural and Model-based Mission Goals and Environment Constraints Temporal Planner Temporal Network Solver Projective Task Expansion Initial Conditions Temporal Plan Dynamic Scheduling

### Application of Bayesian Networks to Shopping Assistance

Application of Bayesian Networks to Shopping Assistance Yang Xiang, Chenwen Ye, and Deborah Ann Stacey University of Guelph, CANADA Abstract. We develop an on-line shopping assistant that can help a e-shopper

### CS 4649/7649 Robot Intelligence: Planning

CS 4649/7649 Robot Intelligence: Planning Motion Planning: Introduction & Reactive Strategies Sungmoon Joo School of Interactive Computing College of Computing Georgia Institute of Technology S. Joo (sungmoon.joo@cc.gatech.edu)

### Spider Search: An Efficient and Non-Frontier-Based Real-Time Search Algorithm

International Journal of Computer Information Systems and Industrial Management Applications (IJCISIM) ISSN: 2150-7988 Vol.2 (2010), pp.234-242 http://www.mirlabs.org/ijcisim Spider Search: An Efficient

### CMPUT680 - Winter 2001

CMPUT680 - Winter 2001 Topic 6: Register Allocation and Instruction Scheduling José Nelson Amaral http://www.cs.ualberta.ca/~amaral/courses/680 CMPUT 680 - Compiler Design and Optimization 1 Reading List

### The Evolution of Transport Planning

The Evolution of Transport Planning On Proportionality and Uniqueness in Equilibrium Assignment Michael Florian Calin D. Morosan Background Several bush-based algorithms for computing equilibrium assignments

### Pedestrian Dynamics: Models of Pedestrian Behaviour

Pedestrian Dynamics: Models of Pedestrian Behaviour John Ward 19 th January 2006 Contents Macro-scale sketch plan model Micro-scale agent based model for pedestrian movement Development of JPed Results

### Algorithms and Data Structures

Algorithms and Data Structures CMPSC 465 LECTURES 22-23 Binary Search Trees Adam Smith S. Raskhodnikova and A. Smith. Based on slides by C. Leiserson and E. Demaine. 1 Heaps: Review Heap-leap-jeep-creep(A):

### y ) s x x )(y i (x i r = 1 n 1 s y Statistics Lecture 7 Exploring Data , y 2 ,y n (x 1 ),,(x n ),(x 2 ,y 1 How two variables vary together

Statistics 111 - Lecture 7 Exploring Data Numerical Summaries for Relationships between Variables Administrative Notes Homework 1 due in recitation: Friday, Feb. 5 Homework 2 now posted on course website:

### Provably Secure Camouflaging Strategy for IC Protection

Provably Secure Camouflaging Strategy for IC Protection Meng Li 1 Kaveh Shamsi 2 Travis Meade 2 Zheng Zhao 1 Bei Yu 3 Yier Jin 2 David Z. Pan 1 1 Electrical and Computer Engineering, University of Texas

### Torpedoes on Target: EAs on Track

113 Torpedoes on Target: EAs on Track Nicole Patterson, Luigi Barone and Cara MacNish School of Computer Science & Software Engineering The University of Western Australia M002, 35 Stirling Highway, Crawley,

### If you need to reinstall FastBreak Pro you will need to do a complete reinstallation and then install the update.

Using this Beta Version of FastBreak Pro First, this new beta version (Version 6.X) will only work with users who have version 5.X of FastBreak Pro. We recommend you read this entire addendum before trying

### Maximum CPU utilization is obtained by multiprogramming. CPU I/O Burst Cycle Process execution consists of a cycle of CPU execution and I/O wait

Chapter 5: CPU Scheduling Basic Concepts Maximum CPU utilization is obtained by multiprogramming CPU I/O Burst Cycle Process execution consists of a cycle of CPU execution and I/O wait Burst access CPU

### CS472 Foundations of Artificial Intelligence. Final Exam December 19, :30pm

CS472 Foundations of Artificial Intelligence Final Exam December 19, 2003 12-2:30pm Name: (Q exam takers should write their Number instead!!!) Instructions: You have 2.5 hours to complete this exam. The

### Running the Table: An AI for Computer Billiards

Running the Table: An AI for Computer Billiards Michael Smith Department of Computing Science, University of Alberta Edmonton, Canada T6G 2E8 smith@cs.ualberta.ca Abstract Billiards is a game of both strategy

### UNIT V 1. What are the traffic management measures? [N/D-13] 2. What is Transportation System Management (TSM)? [N/D-14]

UNIT V 1. What are the traffic management measures? [N/D-13] Some of the well-known traffic management measures are: a) Restrictions on turning movements b) One - way streets c) Tidal - flow operations

### Analysis of Professional Cycling Results as a Predictor for Future Success

Analysis of Professional Cycling Results as a Predictor for Future Success Alex Bertrand Introduction As a competitive sport, road cycling lies in a category nearly all its own. Putting aside the sheer

### The system design must obey these constraints. The system is to have the minimum cost (capital plus operating) while meeting the constraints.

Computer Algorithms in Systems Engineering Spring 2010 Problem Set 6: Building ventilation design (dynamic programming) Due: 12 noon, Wednesday, April 21, 2010 Problem statement Buildings require exhaust

### Has no formal authority but Coaches the Development Team in self-organization and crossfunctionality

Scrum Master is a servant-leader for the Scrum Team. The Scrum Master helps those outside the Scrum Team understand which of their interactions with the Scrum Team are helpful and which aren t. The Scrum

### Heap Sort. Lecture 35. Robb T. Koether. Hampden-Sydney College. Mon, Apr 25, 2016

Heap Sort Lecture 35 Robb T. Koether Hampden-Sydney College Mon, Apr 25, 2016 Robb T. Koether (Hampden-Sydney College) Heap Sort Mon, Apr 25, 2016 1 / 14 1 Sorting 2 The Heap Sort Robb T. Koether (Hampden-Sydney

### How to achieve fluid traffic

Kanton Basel-Stadt How to achieve fluid traffic Objectives, instruments and limits of traffic management Alain Groff, Office for Mobility, Canton of Basel-Stadt Overview Some figures about Basel Tools

### CS 351 Design of Large Programs Zombie House

CS 351 Design of Large Programs Zombie House Instructor: Joel Castellanos e-mail: joel@unm.edu Web: http://cs.unm.edu/~joel/ Office: Electrical and Computer Engineering building (ECE). Room 233 2/23/2017

### Proceedings of Meetings on Acoustics

Proceedings of Meetings on Acoustics Volume 9, 2010 http://acousticalsociety.org/ 159th Meeting Acoustical Society of America/NOISE-CON 2010 Baltimore, Maryland 19-23 April 2010 Session 1pBB: Biomedical

### Roundabouts along Rural Arterials in South Africa

Krogscheepers & Watters 0 0 Word count: 00 text + figures = 0 equivalent words including Title and Abstract. Roundabouts along Rural Arterials in South Africa Prepared for: rd Annual Meeting of Transportation

### Characterizers for control loops

Characterizers for control loops By: F. G. Shinskey (May 1999) Introduction Commercial controllers such as the PID series (proportional, integral, derivative, and their combinations) are linear devices

### Efficient Minimization of Routing Cost in Delay Tolerant Networks

Computer Science Department Christos Tsiaras tsiaras@aueb.gr Master Thesis Presentation (short edition) Efficient Minimization of Routing Cost in Delay Tolerant Networks Supervised by Dr. Stavros Toumpis

### CRaMS. Controlled Resolution and Manipulation System. (a combination of mental image, module, sight, and memory) By JERRY STORY

CRaMS Controlled Resolution and Manipulation System (a combination of mental image, module, sight, and memory) By JERRY STORY CRaMS Educational Instructions The CRaMS method of calling takes in most modern

### Decision Trees. an Introduction

Decision Trees an Introduction Outline Top-Down Decision Tree Construction Choosing the Splitting Attribute Information Gain and Gain Ratio Decision Tree An internal node is a test on an attribute A branch

### DESIGN AND ANALYSIS OF ALGORITHMS (DAA 2017)

DESIGN AND ANALYSIS OF ALGORITHMS (DAA 2017) Veli Mäkinen 12/05/2017 1 COURSE STRUCTURE 7 weeks: video lecture -> demo lecture -> study group -> exercise Video lecture: Overview, main concepts, algorithm

### Ch 12 Homework. Name: Homework problems are from the Serway & Vuille 10 th edition. Follow the instructions and show your work clearly. 1.

Ch 12 Homework Name: Homework problems are from the Serway & Vuille 10 th edition. Follow the instructions and show your work clearly. 1. (Problem 1) An ideal gas is enclosed in a cylinder with a movable

### Tokyo: Simulating Hyperpath-Based Vehicle Navigations and its Impact on Travel Time Reliability

CHAPTER 92 Tokyo: Simulating Hyperpath-Based Vehicle Navigations and its Impact on Travel Time Reliability Daisuke Fukuda, Jiangshan Ma, Kaoru Yamada and Norihito Shinkai 92.1 Introduction Most standard

### ISyE 3103 Introduction to Supply Chain Modeling: Logistics Summer 2012 Homework 8 Issued: July 11, 2012 Due: July 18, 2012

ISyE 3103 Introduction to Supply Chain Modeling: Logistics Summer 2012 Homework 8 Issued: July 11, 2012 Due: July 18, 2012 Single-Vehicle, Multiple-Destination Transportation Routing (Traveling Salesman

### knn & Naïve Bayes Hongning Wang

knn & Naïve Bayes Hongning Wang CS@UVa Today s lecture Instance-based classifiers k nearest neighbors Non-parametric learning algorithm Model-based classifiers Naïve Bayes classifier A generative model

### Building an NFL performance metric

Building an NFL performance metric Seonghyun Paik (spaik1@stanford.edu) December 16, 2016 I. Introduction In current pro sports, many statistical methods are applied to evaluate player s performance and

### The Rule of Right-Angles: Exploring the term Angle before Depth

The Rule of Right-Angles: Exploring the term Angle before Depth I m a firm believer in playing an efficient game. Goaltenders can increase their efficiency in almost every category of their game, from

### Queue analysis for the toll station of the Öresund fixed link. Pontus Matstoms *

Queue analysis for the toll station of the Öresund fixed link Pontus Matstoms * Abstract A new simulation model for queue and capacity analysis of a toll station is presented. The model and its software

### Neural Networks II. Chen Gao. Virginia Tech Spring 2019 ECE-5424G / CS-5824

Neural Networks II Chen Gao ECE-5424G / CS-5824 Virginia Tech Spring 2019 Neural Networks Origins: Algorithms that try to mimic the brain. What is this? A single neuron in the brain Input Output Slide

### Author s Name Name of the Paper Session. Positioning Committee. Marine Technology Society. DYNAMIC POSITIONING CONFERENCE September 18-19, 2001

Author s Name Name of the Paper Session PDynamic Positioning Committee Marine Technology Society DYNAMIC POSITIONING CONFERENCE September 18-19, 2001 POWER PLANT SESSION A New Concept for Fuel Tight DP

### Bicycle and Pedestrian Planning in a Historically Car-Centric Culture: A Focus on Connectivity, Safety, & Accessibility

Bicycle and Pedestrian Planning in a Historically Car-Centric Culture: A Focus on Connectivity, Safety, & Accessibility Kate Horton and Zylavian Watley Transportation Planners Memphis MPO Date: October

### Determining Occurrence in FMEA Using Hazard Function

Determining Occurrence in FMEA Using Hazard Function Hazem J. Smadi Abstract FMEA has been used for several years and proved its efficiency for system s risk analysis due to failures. Risk priority number

### Incompressible Potential Flow. Panel Methods (3)

Incompressible Potential Flow Panel Methods (3) Outline Some Potential Theory Derivation of the Integral Equation for the Potential Classic Panel Method Program PANEL Subsonic Airfoil Aerodynamics Issues

### You should know how to find the gradient of a straight line from a diagram or graph. This next section is just for revision.

R1 INTERPRET THE GRADIENT OF A STRAIGHT LINE GRAPH AS A RATE OF CHANGE; RECOGNISE AND INTERPRET GRAPHS THAT ILLUSTRATE DIRECT AND INVERSE PROPORTION (foundation and higher tier) You should know how to

### Decompression Method For Massive Compressed Files In Mobile Rich Media Applications

2010 10th IEEE International Conference on Computer and Information Technology (CIT 2010) Decompression Method For Massive Compressed Files In Mobile Rich Media Applications Houchen Li, Zhijie Qiu, Lei

### PREDICTING the outcomes of sporting events

CS 229 FINAL PROJECT, AUTUMN 2014 1 Predicting National Basketball Association Winners Jasper Lin, Logan Short, and Vishnu Sundaresan Abstract We used National Basketball Associations box scores from 1991-1998

### Reliability. Introduction, 163 Quantifying Reliability, 163. Finding the Probability of Functioning When Activated, 163

ste41912_ch04_123-175 3:16:06 01.29pm Page 163 SUPPLEMENT TO CHAPTER 4 Reliability LEARNING OBJECTIVES SUPPLEMENT OUTLINE After completing this supplement, you should be able to: 1 Define reliability.

### Waves. harmonic wave wave equation one dimensional wave equation principle of wave fronts plane waves law of reflection

Waves Vocabulary mechanical wave pulse continuous periodic wave amplitude wavelength period frequency wave velocity phase transverse wave longitudinal wave intensity displacement wave number phase velocity

### A SEMI-PRESSURE-DRIVEN APPROACH TO RELIABILITY ASSESSMENT OF WATER DISTRIBUTION NETWORKS

A SEMI-PRESSURE-DRIVEN APPROACH TO RELIABILITY ASSESSMENT OF WATER DISTRIBUTION NETWORKS S. S. OZGER PhD Student, Dept. of Civil and Envir. Engrg., Arizona State Univ., 85287, Tempe, AZ, US Phone: +1-480-965-3589

### Bulgarian Olympiad in Informatics: Excellence over a Long Period of Time

Olympiads in Informatics, 2017, Vol. 11, 151 158 2017 IOI, Vilnius University DOI: 10.15388/ioi.2017.12 151 Bulgarian Olympiad in Informatics: Excellence over a Long Period of Time Emil KELEVEDJIEV 1,

### Applying Bi-objective Shortest Path Methods to Model Cycle Route-choice

Applying Bi-objective Shortest Path Methods to Model Cycle Route-choice Chris Van Houtte, Judith Y. T. Wang, and Matthias Ehrgott September 30, 2009 Outline Commuter Cyclists Motivation Choice Set Route

### Optimal Weather Routing Using Ensemble Weather Forecasts

Optimal Weather Routing Using Ensemble Weather Forecasts Asher Treby Department of Engineering Science University of Auckland New Zealand Abstract In the United States and the United Kingdom it is commonplace