http://cswiki.wlu.edu/dokuwiki/ 2026-04-29T10:27:03+00:00 http://cswiki.wlu.edu/dokuwiki/ http://cswiki.wlu.edu/dokuwiki/lib/exe/fetch.php/wiki/dokuwiki-128.png text/html 2014-01-16T21:03:04+00:00 Anonymous (anonymous@undisclosed.example.com) http://cswiki.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2014/journals/kinsey/chapter1?rev=1389906184&do=diff 1.1 A First Problem: Stable Matching This chapter was an introduction to the concept of stability. The textbook uses the Gale and Shapley algorithm to illustrate what it means to have an outcome that is completely stable, self-interest doesn’t compel any person to reject their matched pair. The algorithm can only terminate when every man has a finance, therefore a perfect match is possible every execution. The GS algorithm is an O(n^2) algorithm since in the worst case scenario every man propos… text/html 2014-04-03T15:32:20+00:00 Anonymous (anonymous@undisclosed.example.com) http://cswiki.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2014/journals/kinsey/home?rev=1396539140&do=diff Kinsey's Journal Chapter 1 Chapter 2 Preface Algorithm Design is going to explore the nature of algorithms (not programs) and how to derive a clean mathematical solution to a problem. Algorithms apply to many different fields such as economy, biology, bureaucracy in addition to computer science. The authors, Kleinberg and Tardos, define an algorithm as not only a way to text/html 2014-01-16T21:30:18+00:00 Anonymous (anonymous@undisclosed.example.com) http://cswiki.wlu.edu/dokuwiki/doku.php/courses/cs211/winter2014/journals/kinsey/sidebar?rev=1389907818&do=diff Kinsey's Sidebar * Home * Chapter 1 ---------- <- CSCI 211: Algorithm Design and Analysis