http://servo.ad.wlu.edu/dokuwiki/ 2026-05-11T23:17:27+00:00 http://servo.ad.wlu.edu/dokuwiki/ http://servo.ad.wlu.edu/dokuwiki/lib/exe/fetch.php/wiki/dokuwiki-128.png text/html 2018-01-17T04:43:49+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/bowmang/chapter1?rev=1516164229&do=diff Chapter 1.1 (Stable Matching) * Summary of the section * When you have two groups of entities with ranked preferences for who they want to be matched with in the other group you should use a stable matching algorithm. In doing so, you will guarantee the best match possible for all entities in which no two entities would prefer to be matched together over their current match (ie. stable match). This is an extremely useful solution for things like applying to jobs or school as the person ap… text/html 2018-01-30T03:10:37+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/bowmang/chapter2?rev=1517281837&do=diff Chapter 2 Chapter 2.1 (Computational Tractability) What specific approach to efficient algorithms should we take? * Identify broad themes and design principles which we can apply to a variety of problems.\ * Learn to apply these themes and principles to actual problems that vary our implementations subtlety. text/html 2018-02-07T07:02:00+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/bowmang/chapter3?rev=1517986920&do=diff Chapter 3 Chapter 3.1 (Basic Definitions and Applications of Graphs) Definition - Graphs * Graph = way of encoding pairwise relationships among a set of objects * Consists of a collection of both nodes and edges * Nodes * Often called a vertex as well text/html 2018-01-30T02:48:08+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/bowmang/home?rev=1517280488&do=diff Gunnar's Wiki * Preface (pg. 1-2) * Chapter 1: Introduction * Chapter 2: Algorithms * Chapter 3: Graphs text/html 2018-01-18T22:01:21+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/bowmang/preface?rev=1516312881&do=diff Preface * Algorithms as a whole do not just pertain to the field of computer science even though they are commonly used. * Biologists, economists, etc. use them everyday. * Algorithms are not just restricted to the ones that we will learn in this class (ie. well-known, long-standing, clearly defined algorithms). Often times they will be these text/html 2018-01-30T03:11:16+00:00 Anonymous (anonymous@undisclosed.example.com) http://servo.ad.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2018/journals/bowmang/sidebar?rev=1517281876&do=diff Gunnar's Wiki * Preface (pg. 1-2) * Chapter 1: Introduction * Chapter 2: Algorithms * Chapter 3: Graphs ---------- <- Gunnar's Wiki <- CSCI 211: Algorithm Design and Analysis