Honours Algorithm Design COMP-362

Similar documents
AN EXAMPLE OF THE GOMORY CUTTING PLANE ALGORITHM. max z = 3x 1 + 4x 2. 3x 1 x x x x N 2

Given a directed graph G =(N A), where N is a set of m nodes and A. destination node, implying a direction for ow to follow. Arcs have limitations

University of Groningen. Systemen, planning, netwerken Bosman, Aart

(Sub)Gradient Descent

CS 1103 Computer Science I Honors. Fall Instructor Muller. Syllabus

CS Machine Learning

Probability and Game Theory Course Syllabus

On the Polynomial Degree of Minterm-Cyclic Functions

Learning to Schedule Straight-Line Code

Language properties and Grammar of Parallel and Series Parallel Languages

Syntax Parsing 1. Grammars and parsing 2. Top-down and bottom-up parsing 3. Chart parsers 4. Bottom-up chart parsing 5. The Earley Algorithm

Introduction to Ensemble Learning Featuring Successes in the Netflix Prize Competition

Unit 3: Lesson 1 Decimals as Equal Divisions

The Strong Minimalist Thesis and Bounded Optimality

Artificial Neural Networks written examination

Self Study Report Computer Science

A Neural Network GUI Tested on Text-To-Phoneme Mapping

Word Segmentation of Off-line Handwritten Documents

Probabilistic Latent Semantic Analysis

GACE Computer Science Assessment Test at a Glance

Diagnostic Test. Middle School Mathematics

Ensemble Technique Utilization for Indonesian Dependency Parser

Lecture 10: Reinforcement Learning

Radius STEM Readiness TM

Massachusetts Institute of Technology Tel: Massachusetts Avenue Room 32-D558 MA 02139

Discriminative Learning of Beam-Search Heuristics for Planning

Seminar - Organic Computing

Proof Theory for Syntacticians

Lecture 1: Machine Learning Basics

STT 231 Test 1. Fill in the Letter of Your Choice to Each Question in the Scantron. Each question is worth 2 point.

Short vs. Extended Answer Questions in Computer Science Exams

Guide to the Uniform mark scale (UMS) Uniform marks in A-level and GCSE exams

Pretest Integers and Expressions

TOPICS LEARNING OUTCOMES ACTIVITES ASSESSMENT Numbers and the number system

The Indices Investigations Teacher s Notes

Using dialogue context to improve parsing performance in dialogue systems

Arizona s College and Career Ready Standards Mathematics

Using the Attribute Hierarchy Method to Make Diagnostic Inferences about Examinees Cognitive Skills in Algebra on the SAT

Reducing Abstraction When Learning Graph Theory

Math-U-See Correlation with the Common Core State Standards for Mathematical Content for Third Grade

Machine Learning from Garden Path Sentences: The Application of Computational Linguistics

Knowledge Elicitation Tool Classification. Janet E. Burge. Artificial Intelligence Research Group. Worcester Polytechnic Institute

Introduction and Motivation

We are strong in research and particularly noted in software engineering, information security and privacy, and humane gaming.

CLASSIFICATION OF TEXT DOCUMENTS USING INTEGER REPRESENTATION AND REGRESSION: AN INTEGRATED APPROACH

Module 12. Machine Learning. Version 2 CSE IIT, Kharagpur

CHAPTER 4: REIMBURSEMENT STRATEGIES 24

Welcome to. ECML/PKDD 2004 Community meeting

Numeracy Medium term plan: Summer Term Level 2C/2B Year 2 Level 2A/3C

Python Machine Learning

A Comparison of Annealing Techniques for Academic Course Scheduling

TABLE OF CONTENTS TABLE OF CONTENTS COVER PAGE HALAMAN PENGESAHAN PERNYATAAN NASKAH SOAL TUGAS AKHIR ACKNOWLEDGEMENT FOREWORD

Team Formation for Generalized Tasks in Expertise Social Networks

Multimedia Application Effective Support of Education

Evolutive Neural Net Fuzzy Filtering: Basic Description

Study in Berlin at the HTW. Study in Berlin at the HTW

CS 101 Computer Science I Fall Instructor Muller. Syllabus

Working with Rich Mathematical Tasks

Course Outline. Course Grading. Where to go for help. Academic Integrity. EE-589 Introduction to Neural Networks NN 1 EE

Efficient Online Summarization of Microblogging Streams

Natural Language Processing. George Konidaris

Economics Unit: Beatrice s Goat Teacher: David Suits

AQUA: An Ontology-Driven Question Answering System

Emotional Variation in Speech-Based Natural Language Generation

COMPUTER SCIENCE GRADUATE STUDIES Course Descriptions by Methodology

BMBF Project ROBUKOM: Robust Communication Networks

Learning Methods for Fuzzy Systems

An Effective Framework for Fast Expert Mining in Collaboration Networks: A Group-Oriented and Cost-Based Method

COMPUTATIONAL COMPLEXITY OF LEFT-ASSOCIATIVE GRAMMAR

Math 181, Calculus I

Improving Fairness in Memory Scheduling

3D DIGITAL ANIMATION TECHNIQUES (3DAT)

Abstractions and the Brain

Probability and Statistics Curriculum Pacing Guide

COMPUTER SCIENCE GRADUATE STUDIES Course Descriptions by Research Area

OPTIMIZATINON OF TRAINING SETS FOR HEBBIAN-LEARNING- BASED CLASSIFIERS

Value Creation Through! Integration Workshop! Value Stream Analysis and Mapping for PD! January 31, 2002!

Machine Learning and Data Mining. Ensembles of Learners. Prof. Alexander Ihler

"f TOPIC =T COMP COMP... OBJ

Writing a Basic Assessment Report. CUNY Office of Undergraduate Studies

GCSE Mathematics B (Linear) Mark Scheme for November Component J567/04: Mathematics Paper 4 (Higher) General Certificate of Secondary Education

Networks in Cognitive Science

CSL465/603 - Machine Learning

11/29/2010. Statistical Parsing. Statistical Parsing. Simple PCFG for ATIS English. Syntactic Disambiguation

Liquid Narrative Group Technical Report Number

Functional Skills Mathematics Level 2 assessment

The 9 th International Scientific Conference elearning and software for Education Bucharest, April 25-26, / X

Planning with External Events

EECS 700: Computer Modeling, Simulation, and Visualization Fall 2014

Classroom Connections Examining the Intersection of the Standards for Mathematical Content and the Standards for Mathematical Practice

Learning and Transferring Relational Instance-Based Policies

Standards Alignment... 5 Safe Science... 9 Scientific Inquiry Assembling Rubber Band Books... 15

GUIDE TO THE CUNY ASSESSMENT TESTS

Purdue Data Summit Communication of Big Data Analytics. New SAT Predictive Validity Case Study

Science with Kids, Science by Kids By Sally Bowers, Dane County 4-H Youth Development Educator and Tom Zinnen, Biotechnology Specialist

Visit us at:

Effective Supervision: Supporting the Art & Science of Teaching

NEW NCAA Division I Initial-Eligibility Academic Requirements

Benchmarking Curriculum-Based Course Timetabling: Formulations, Data Formats, Instances, Validation, and Results

Milton Public Schools Fiscal Year 2018 Budget Presentation

Transcription:

Lecture Notes Page 1 Honours Algorithm Design COMP-362 Lecture notes by Alexandre Tomberg Prof. Patrick Hayden McGill University Fall 2008

Lecture Notes Page 2 Table of Contents December-03-08 12:16 PM

Lecture Notes Page 3

Lecture Notes Page 4 Dynamic Programming September-04-08 11:46 AM

Lecture Notes Page 5

Lecture Notes Page 6

Lecture Notes Page 7 String Theory September-09-08 11:57 AM

Lecture Notes Page 8

Lecture Notes Page 9 Approximation Algorithm December-03-08 6:43 PM

Lecture Notes Page 10

Lecture Notes Page 11 Dynamic Programming (in disguise) September-11-08 11:39 AM

Lecture Notes Page 12

Lecture Notes Page 13

Lecture Notes Page 14

Lecture Notes Page 15

Lecture Notes Page 16 Independent Set September-11-08 12:40 PM

Lecture Notes Page 17 Greedy Selection September-16-08 11:40 AM

Lecture Notes Page 18 Greedy Weighted Selection Given: While If then Return:

Lecture Notes Page 19

Lecture Notes Page 20

Lecture Notes Page 21 Introduction to Linear Programming September-18-08 11:39 AM

Lecture Notes Page 22 Solving Linear Programming Problems. Linear Programming in General.

Lecture Notes Page 23 Standard Form Duality

Lecture Notes Page 24

Lecture Notes Page 25

Lecture Notes Page 26 Flows October-01-08 10:39 AM

Lecture Notes Page 27 Cuts October-01-08 10:51 AM

Lecture Notes Page 28

Lecture Notes Page 29

Lecture Notes Page 30

Lecture Notes Page 31

Lecture Notes Page 32

Lecture Notes Page 33

Lecture Notes Page 34

Lecture Notes Page 35

Lecture Notes Page 36 Ford -Folkerson Algorithm September-25-08 12:37 PM Ford-Folkerson (G,s,t,c): While do: return Edmonds-Karp:

Lecture Notes Page 37

Lecture Notes Page 38

Lecture Notes Page 39 Applications of Max Flow September-30-08 12:08 PM

Lecture Notes Page 40

Lecture Notes Page 41

Lecture Notes Page 42

Lecture Notes Page 43

Lecture Notes Page 44 Symplex Algorithm October-07-08 11:39 AM

Lecture Notes Page 45

Lecture Notes Page 46

Lecture Notes Page 47

Lecture Notes Page 48

Lecture Notes Page 49

Lecture Notes Page 50

Lecture Notes Page 51

Lecture Notes Page 52 Max Flow & Simplex October-09-08 12:04 PM

Lecture Notes Page 53

Lecture Notes Page 54 Polytime algorithms October-09-08 12:37 PM

Lecture Notes Page 55

Lecture Notes Page 56 Circuit - Satisfiability (Sat) October-14-08 11:50 AM

Lecture Notes Page 57

Lecture Notes Page 58 NP-Complete problems October-14-08 12:35 PM

Lecture Notes Page 59

Lecture Notes Page 60 Independent Set October-16-08 11:42 AM

Lecture Notes Page 61

Lecture Notes Page 62 Vertex Cover October-16-08 12:08 PM

Lecture Notes Page 63 Hamiltonian Cycle October-16-08 12:19 PM

Lecture Notes Page 64

Lecture Notes Page 65

Lecture Notes Page 66 3D -matching October-16-08 12:29 PM

Lecture Notes Page 67

Lecture Notes Page 68 Integer Linear Programming October-21-08 12:19 PM

Lecture Notes Page 69

Lecture Notes Page 70 Subset Sum October-21-08 12:30 PM

Lecture Notes Page 71 Feed forward Neural Nets October-23-08 11:55 AM

Lecture Notes Page 72

Lecture Notes Page 73

Lecture Notes Page 74

Lecture Notes Page 75

Lecture Notes Page 76

Lecture Notes Page 77 Complement of NP October-23-08 12:04 PM

Lecture Notes Page 78 k-colorability October-30-08 11:39 AM

Lecture Notes Page 79 How to deal with NP-hardness October-30-08 11:48 AM

Lecture Notes Page 80

Backtrack (problem P) Lecture Notes Page 81

Lecture Notes Page 82 Branch & Bound (problem P): while choose expand for each if else if return (best)

Lecture Notes Page 83

Lecture Notes Page 84 Approximate solutions of Vertex Cover problem November-04-08 11:48 AM

Lecture Notes Page 85

Lecture Notes Page 86

Lecture Notes Page 87

Lecture Notes Page 88

Lecture Notes Page 89 Set Cover November-06-08 11:39 AM

Lecture Notes Page 90

Lecture Notes Page 91

Lecture Notes Page 92

Lecture Notes Page 93 k-cluster November-06-08 12:21 PM

Lecture Notes Page 94

Lecture Notes Page 95 Metric Traveling Salesman Problem November-06-08 12:45 PM

Lecture Notes Page 96 Approximability November-11-08 11:41 AM

Lecture Notes Page 97

Lecture Notes Page 98 Probabilistically Checkable Proofs (PCP) November-11-08 11:53 AM

Lecture Notes Page 99

Lecture Notes Page 100

Lecture Notes Page 101

Lecture Notes Page 102

Lecture Notes Page 103

Lecture Notes Page 104 Dealing with NP- hardness November-13-08 12:23 PM

Lecture Notes Page 105

Lecture Notes Page 106 Tree Width November-18-08 11:41 AM

Lecture Notes Page 107

Lecture Notes Page 108

Lecture Notes Page 109

Lecture Notes Page 110

Lecture Notes Page 111

Lecture Notes Page 112

Lecture Notes Page 113

Lecture Notes Page 114 Control-flow graphs November-20-08 12:19 PM

Lecture Notes Page 115 Finding Tree Decompositions November-20-08 12:31 PM

Lecture Notes Page 116 Final Exam November-27-08 12:25 PM

Lecture Notes Page 117 NPC Reductions Map December-03-08 11:03 AM

Lecture Notes Page 118 Computation & Time Travel November-25-08 11:41 AM