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

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 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. CPSC 444: Artificial Intelligence Spring CPSC 444: Artificial Intelligence Spring (# liters in 3-liter jug, # of liters in 4-liter jug) initial state (0,0) goal states (2,*) (*,2) and successor function fill jug fill 3-liter jug: (m,n) (3,n) [m < 3] fill 4-liter jug: (m,n) (m,4) [n < 4] empty jug empty 3-liter jug: (m,n) (0,n) [m > 0] empty 4-liter jug: (m,n) (m,0) [n > 0] pour from one jug into another, until source jug is empty or target jug is full from 3-liter to 4-liter: (m,n) (m-min(m,4-n),n+min(m,4-n)) [m > 0, n < 4] from 4-liter to 3-liter: (m,n) (m+min(3-m,n),n-min(3-m,n)) [m < 3, n > 0] number of steps permutation of tiles how the blank tile moves left, right, up, down number of moves made CPSC 444: Artificial Intelligence Spring CPSC 444: Artificial Intelligence Spring

2 Geometric analogy problems. Considerations. running time of search depends on branching factor - number of rules applicable to a given state length of solution path - shorter is better CPSC 444: Artificial Intelligence Spring CPSC 444: Artificial Intelligence Spring Search Techniques a set of statements about the shapes in a particular picture e.g. inside(a,b), left(a,b), above(a,b) allowed transformations e.g. scale(a,factor), delete(a), insertleft(a,b), insertabove(a,b), rotate(a,angle) number of transformations can also weight transformations to give priority to certain operations over others The state space forms a tree or graph. graph may be directed (some moves not reversible) or undirected (all moves reversible) uninformed (blind) search know only if a state is goal or not informed (heuristic) search can determine if one non-goal state is more promising than another adversarial search finding a good solution against an opponent who is trying to do the same CPSC 444: Artificial Intelligence Spring CPSC 444: Artificial Intelligence Spring

3 Evaluating Search Techniques Implementation Details Four properties: completeness are we guaranteed to find a solution if there is one? optimality does the algorithm find the best solution? time complexity how long does it take to find a solution? space complexity how much memory is needed to perform the search How do you determine the solution path once you've found a solution? search state includes the current problem state + the previous state and the rule applied to get to this state CPSC 444: Artificial Intelligence Spring CPSC 444: Artificial Intelligence Spring Implementation Details depth-first search (DFS) use stack for S If generate new state is implemented as a mutator, be sure to copy the current state first. breadth-first search (BFS) use queue for S CPSC 444: Artificial Intelligence Spring CPSC 444: Artificial Intelligence Spring

4 Recursive DFS solution dfs ( state, move ) { if state is the goal state return new solution containing only move } for each applicable rule generate new state if dfs(new state,rule) is successful add move to the solution found return solution return null // failure does not require an explicit stack call stack size may be limited by the runtime environment can generate new state without copying (though must then restore) CPSC 444: Artificial Intelligence Spring Time and space. b is average branching factor, m is tree depth, d is depth of solution max tree depth is length of the longest path DFS time is O(b m ), space is O(bm) time can be O(mb m ) if path is checked to avoid cycles marking states as explored instead means O(1) cycle check but O(b m ) space BFS time is O(b d ), space is O(b d ) CPSC 444: Artificial Intelligence Spring Uninformed Search DLS and IDS DFS is not optimal or complete. not guaranteed to find shortest path, unless all paths are explored and the best chosen may get stuck if there are cycles can prevent by checking current state against previous states on path may be desirable to avoid re-discovering states if there are alternate paths BFS is optimal and complete. always finds a solution always finds the shortest path may need to avoid re-discovering states if there are cycles or alternate paths Goal: DFS space requirements, with optimality and completeness. depth-limited search (DLS) DFS with a maximum depth search does not consider states deeper than that prevents infinite cycling (can omit cycle check) not optimal or complete not guaranteed to find shortest path, unless all paths are explored and the best chosen may not find a solution if the depth limit is too shallow time O(b l ), space O(bl) b = average branching factor l = depth limit of search CPSC 444: Artificial Intelligence Spring CPSC 444: Artificial Intelligence Spring

5 Uninformed Search DLS and IDS Goal: DFS space requirements, with optimality and completeness. iterative deepening (IDS) DLS with progressively-increasing depths until solution is found complete and optimal always finds a solution not trapped by cycles (no need for cycle check) finds shallowest solution time O(b d ), space O(bd) b = average branching factor d = depth of solution lots of repeated work (lower depths are searched over and over) but search time is dominated by the last level CPSC 444: Artificial Intelligence Spring

### 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

### 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

### 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

### 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

### 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

### 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

### 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).

### 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

### 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

### 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

### 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

### 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 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

### 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

### Uninformed search methods II.

CS 2710 Foundations of AI Lecture 4 Uninformed search methods II. Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Announcements Homework assignment 1 is out Due on Tuesday, September 12, 2017 before

### 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

### 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

### 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

### 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

### 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 },

### 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

### 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:

### 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

### 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

### 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

### 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

### 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

### 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

### 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

### Aryeh Rappaport Avinoam Meir. Schedule automation

Aryeh Rappaport Avinoam Meir Schedule automation Introduction In this project we tried to automate scheduling. Which is to help a student to pick the time he takes the courses so they want collide with

### /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

### 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

### 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

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

### 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,

### Problem-Solving: A* and Beyond. CSCI 3202, Fall 2010

Problem-Solving: A* and Beyond CSCI 3202, Fall 2010 Administrivia Reading for this week: 4.1.1-4.1.3 (up to p. 126) in R+N; 5.1-5.4 (pp. 161-176) Problem Set 1 will be posted by tomorrow morning; due September

### CT PET-2018 Part - B Phd COMPUTER APPLICATION Sample Question Paper

CT PET-2018 Part - B Phd COMPUTER APPLICATION Sample Question Paper Note: All Questions are compulsory. Each question carry one mark. 1. Error detection at the data link layer is achieved by? [A] Bit stuffing

### 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

### Ocean Fishing Fleet Scheduling Path Optimization Model Research. Based On Improved Ant Colony Algorithm

4th International Conference on Sensors, Measurement and Intelligent Materials (ICSMIM 205) Ocean Fishing Fleet Scheduling Path Optimization Model Research Based On Improved Ant Colony Algorithm Li Jia-lin2,

### 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 )(

### 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

### Neural Nets Using Backpropagation. Chris Marriott Ryan Shirley CJ Baker Thomas Tannahill

Neural Nets Using Backpropagation Chris Marriott Ryan Shirley CJ Baker Thomas Tannahill Agenda Review of Neural Nets and Backpropagation Backpropagation: The Math Advantages and Disadvantages of Gradient

### 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

### Poseidon Team Description Paper RoboCup 2016, Leipzig, Germany

Poseidon Team Description Paper RoboCup 2016, Leipzig, Germany Yasamin Alipour 1, Melina Farshbaf Nadi 1, Kiana Jahedi 2, Kimia Javadi 1, Pooria Kaviani 3, Seyedeh Behin Mousavi Madani 1, Rozhina Pourmoghaddam

### 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):

### 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

### Dispatching Universität Karlsruhe, System Architecture Group

µ-kernel Construction (6) Dispatching 1 Dispatching Topics Thread switch To a specific thread To next thread to be scheduled To nil Implicitly, when IPC blocks Priorities Preemption Time slices Wakeups,

### 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

### 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

### 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

### The 19 th hole - 18 Card Micro Golf game. # Of Players: 1 or 2 players. Game time: min per game if a 2 player game.

The 19 th hole - 18 Card Micro Golf game # Of Players: 1 or 2 players Game time: 30 45 min per game if a 2 player game. Components [4] - TEE BOXES [4] - PUTTING GREENS [6] - FAIRWAY [2] - Player golf ball

### 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

### Scrum Basics. Prof. Casper Lassenius Aalto University

Scrum Basics Prof. Casper Lassenius Aalto University Goals of This Lecture Teach you Why you need a process for working in your projects Basics of the Scrum process Roles Process steps Terminology After

### 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

### 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 Differential Kinematics, Probabilistic Roadmaps Sungmoon Joo School of Interactive Computing College of Computing Georgia Institute of Technology S. Joo (sungmoon.joo@cc.gatech.edu)

### 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

### 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,

### The Incremental Evolution of Gaits for Hexapod Robots

The Incremental Evolution of Gaits for Hexapod Robots Abstract Gait control programs for hexapod robots are learned by incremental evolution. The first increment is used to learn the activations required

### 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)

### 1.1 The size of the search space Modeling the problem Change over time Constraints... 21

Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 I What Are the Ages of My Three Sons? : : : : : : : : : : : : : : : : : 9 1 Why Are Some Problems Dicult to Solve? : : :

### Optimizing Cyclist Parking in a Closed System

Optimizing Cyclist Parking in a Closed System Letu Qingge, Killian Smith Gianforte School of Computing, Montana State University, Bozeman, MT 59717, USA Abstract. In this paper, we consider the two different

### 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

### 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,

### 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

### A new Decomposition Algorithm for Multistage Stochastic Programs with Endogenous Uncertainties

A new Decomposition Algorithm for Multistage Stochastic Programs with Endogenous Uncertainties Vijay Gupta Ignacio E. Grossmann Department of Chemical Engineering Carnegie Mellon University, Pittsburgh

### 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

### 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

### Phoenix Soccer 2D Simulation Team Description Paper 2015

Phoenix Soccer 2D Simulation Team Description Paper 2015 Aryan Akbar Poor 1, Mohammad Poor Taheri 1, Alireza Mahmoodi 1, Ali Charkhestani 1 1 Iran Atomic Energy High School Phonix.robocup@gmail.com Abstract.

### Cyrus Soccer 2D Simulation

Cyrus Soccer 2D Simulation Team Description Paper 2013 Miracle Robotic Group Team Manager : Rouf Khayami Nader Zare, Hossein Zolanvar, Peyman Mahoor Moein Fatehi, Maryam Karimi, Fateme Tekrar, Ehsan Asali

### Lesson 5.3 Interpreting and Sketching Graphs Exercises (pages )

Lesson 5.3 Interpreting and Sketching Graphs Exercises (pages 281 283) A 3. a) Bear F has the greatest mass because it is represented by the point on the graph farthest to the right and the horizontal

### 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)

### Traveling Salesperson Problem and. its Applications for the Optimum Scheduling

Traveling Salesperson Problem and its Applications for the Optimum Scheduling Introduction When you think of the sports, what word do you imagine first? Competition? Winner? Soccer? Those words pretty

### MA PM: Memetic algorithms with population management

MA PM: Memetic algorithms with population management Kenneth Sörensen University of Antwerp kenneth.sorensen@ua.ac.be Marc Sevaux University of Valenciennes marc.sevaux@univ-valenciennes.fr August 2004

### A Game-Theoretic Intelligent Agent for the Board Game Football Strategy

A Game-Theoretic Intelligent Agent for the Board Game Football Strategy Sean McCulloch Ohio Wesleyan University stmccull@owu.edu Abstract While much work has been done in the development of intelligent

### Efficient Globally Op5mal Consensus Maximisa5on with Tree Search

Efficient Globally Op5mal Consensus Maximisa5on with Tree Search Tat- Jun Chin School of Computer Science The University of Adelaide 1 of 45 Maximum consensus max, I X I subject to r i ( ) apple 8x i 2

### EE582 Physical Design Automation of VLSI Circuits and Systems

EE Prof. Dae Hyun Kim School of Electrical Engineering and Computer Science Washington State University Routing Grid Routing Grid Routing Grid Routing Grid Routing Grid Routing Lee s algorithm (Maze routing)

### 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

### 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

### Subsea Wellhead and Conductor Fatigue

Subsea Wellhead and Conductor Fatigue 29th January 2014 Simeon Powell, PE Importance of Wellhead Fatigue Fatigue failure of high pressure wellhead housing Due to VIV West of Shetland Region 440 meter water

### LegenDary 2012 Soccer 2D Simulation Team Description Paper

LegenDary 2012 Soccer 2D Simulation Team Description Paper Pourya Saljoughi 1, Reza Ma'anijou 1, Ehsan Fouladi 1, Narges Majidi 1, Saber Yaghoobi 1, Houman Fallah 1 and Saeideh Zahedi 1 1 Islamic Azad

### 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

### Improving the Bus Network through Traffic Signalling. Henry Axon Transport for London

Improving the Bus Network through Traffic Signalling Henry Axon Transport for London Improving the Bus Network through Traffic Signalling Introduction Transport for London (TfL) operates the most frequent

### Lesson 6: Water, Water Everywhere

Earth -> 6: Water, Water Everywhere Getting Started Lesson 6: Water, Water Everywhere? Big Ideas P How do living things depend on the Earth for survival? P What are examples of matter found on Earth? P

### 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

### ENG. An Implementation Study of Flow Algorithms in. Unit Capacity, Undirected Networks. Dennis S. Ruhl

An Implementation Study of Flow Algorithms in Unit Capacity, Undirected Networks by Dennis S. Ruhl Submitted to the Department of Electrical Engineering and Computer Science in Partial Fulfillment of the

### Summary of Most Common Rules of GOLF (check with USGA for current and complete rules)

Summary of Most Common Rules of GOLF (check with USGA for current and complete rules) 1. You know or are virtually sure that your ball went into a water hazard. What are your options? A. Yellow Water Hazard

### OD plug gauge. for bores and internal profiles from dia. 2,5 mm. OD plug gauge in open design. Special designs Accessories. OD plug gauge for various

OD plug gauge for various bore diameters Cross sleeve Cross sleeve with runners OD plug gauge for bores and internal profiles from dia. 2,5 300 Oskar Schwenk GmbH & Co. Esslinger Straße 84 70736 Fellbach

### 3D Inversion in GM-SYS 3D Modelling

3D Inversion in GM-SYS 3D Modelling GM-SYS 3D provides a wide range of inversion options including inversion for both layer structure and physical properties for gravity and magnetic data. There is an

### Improving the bass response of Schroeder diffusers

Improving the bass response of Schroeder diffusers Hargreaves, JA and Cox, TJ Title Authors Type URL Published Date 23 Improving the bass response of Schroeder diffusers Hargreaves, JA and Cox, TJ Conference

### 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

### Identifying and Developing the High School Triple Jumper

Identifying and Developing the High School Triple Jumper Eric Schueffner Oregon State University WISTCA 2017 There are a number of things to consider when looking for young athletes and implementing techniques

INSTRUCTION 1(10) ACCESS TO CONFINED SPACES Table of contents: 1 PURPOSE 2 DEFINITIONS 3 RESPONSIBILITY 4 DESCRIPTION 4.1 Standby person 4.2 Blinds 4.3 Approval of blind and blanks list 4.4 Installing/removing

### On Underwater Vehicle Routing Problem

On Underwater Vehicle Routing Problem Wojciech Bożejko (B), Szymon Jagie l lo, Micha l Lower, and Czes law Smutnicki Faculty of Electronics, Wroc law University of Technology, Janiszewskiego 11-17, 50-372

### 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

### SMRU/Series 9000 SRDL/CTD. (Standard CTD) Valid for dates in years 2013 to Software specification for CTD_GEN_13A deployment

Eventlabel CAR2013_sel_a_m_09 Campaign King George Island 2013 Species Age Sex Number Length (total) Length (standard) Length (curvatur) Girth (pectoral Weight [estimated] Weight [calculated] Weight [measured]