uwloo

MATH 457(b) Selected Topics in Applied Combinatorics

Faculty
Mathematics
Last listed
1974–75

No longer offered. It’s in Waterloo’s scanned calendars from 1973–74 to 1974–75 (before that, 1968–69 to 1972–73 used the number for Applied Combinatorial Mathematics); the 1995–96 to 2023–24 calendars are on ucalendar.

Brief recapitulation of information retrieval and the use of classificatory methods; formal models of classification methods; necessary conditions; equivalence of structure; quantification of equivalence; order independence; stability; training methods and their implication in information retrieval; optimization problems; perturbation functions and their algebraic structure; heuristics. 2 hours lectures, one term Prerequisite: M353 (a) (not offered in 1974-75)

As printed in the 1973–74 to 1974–75 calendars, read by OCR; the scanned page is the original.

Check it elsewhere

    In the scanned calendars

    How it read in each calendar from 1968–69 to 1974–75, newest first. The text is OCR of the scanned pages; years whose wording matches are shown once, from the clearest scan. Each year links to its page on uwloo and to that page of the scanned PDF.

    1973–74 to 1974–75 2 calendars

    Brief recapitulation of information retrieval and the use of classificatory methods; formal models of classification methods; necessary conditions; equivalence of structure; quantification of equivalence; order independence; stability; training methods and their implication in information retrieval; optimization problems; perturbation functions and their algebraic structure; heuristics. 2 hours lectures, one term Prerequisite: M353 (a) (not offered in 1974-75)

    1968–69 to 1972–73 4 calendars

    Another title: Applied Combinatorial Mathematics, probably a different course under the same number (or a misread scan).

    May include any subset of the following topics: applications of combinatorial mathematics to optimization, selected topics from the Beckenbach book, structural models, graphs and electrical networks, graph theory and statistical mechanics, the Ising problem, percolation processes, the dimer problem, random walk, applications to chemistry, automata. 2 hours lectures.