Difference between revisions of "Cs488-2009"
Jump to navigation
Jump to search
(→Class Presentation Schedule) |
|||
Line 40: | Line 40: | ||
* Aaron - Ch. 42: Number Systems for Computing | * Aaron - Ch. 42: Number Systems for Computing | ||
===September 16=== | ===September 16=== | ||
− | * Sam L-M - Ch. 33 | + | * Sam L-M - Ch. 33: Analog Computation |
* Dylan - Ch. 56: VLSI | * Dylan - Ch. 56: VLSI | ||
===September 23=== | ===September 23=== | ||
Line 47: | Line 47: | ||
* Sam W - Ch. 4: Simulation, The Monte Carlo Method (p.22) | * Sam W - Ch. 4: Simulation, The Monte Carlo Method (p.22) | ||
* Nate - Ch 64: Logic Programming (p. 420) | * Nate - Ch 64: Logic Programming (p. 420) | ||
− | |||
===October 7=== | ===October 7=== | ||
− | * Brad - Game Trees | + | * Brad - Ch. 6: Game Trees |
− | * Aaron - | + | * Aaron - Ch. 54: NP Complete Problems |
− | |||
===October 14=== | ===October 14=== | ||
− | * Sam L-M - | + | * Sam L-M - Ch. 44: Cellular Automata |
* Dylan - | * Dylan - | ||
===October 21=== | ===October 21=== | ||
Line 59: | Line 57: | ||
* Nate - | * Nate - | ||
===October 28=== | ===October 28=== | ||
− | * Brad - | + | * Brad - Ch. 16: Genetic Algorithms (p.103) |
* Aaron - | * Aaron - | ||
===November 4=== | ===November 4=== |
Revision as of 10:54, 19 October 2009
Contents
Research Topics
- Aaron - Developing computer games for education
- Brad - Combinatorial Game Theory demonstrated by competing clusters
- Dylan -
- Nate - Algorithmic Cut-Up Poetry Generation Using Large Internet-Based Corpuses
- Sam L-M - Computational English language recognition and synthesis in database interfacing
- Sam W - The use of Monte Carlo methods in simulations
Topic Allocation
- SIMULATION The Monte Carlo Method - Samuel
- GAME TRESS The Minimax Method - Brad
- MATHEMATICAL RESEARCH The Mandelbrot Set - Nate
- GENETIC ALGORITHMS Solutions That Evolve - Brad
- COMPUTER VISION Polyhedral Scenes - Brad
- PERCEPTIONS A Lack of Vision - Nate
- ANALOG COMPUTATION Spaghetti Computers - Sam Leeman-Munk
- NEURAL NETWORKS THAT LEARN Converting Coordinates - Samuel
- PUBLIC KEY CRYPTOGRAPHY Intractable Secrets - Samuel
- NUMBER SYSTEMS FOR COMPUTING Chinese Arithmetic - Aaron
- CELLULAR AUTOMATA The Game of Life - Sam Leeman-Munk
- COOK'S THEOREM Nuts and Bolts - Aaron
- SELF-REPLICATING COMPUTERS Codd's Machine - Sam Leeman-Munk
- STORING IMAGES A Cat in a Quad Tree - Nate
- THE SCRAM A Simplified Computer - Dylan
- SHANNON'S THEORY The Elusive Codes - Aaron
- NP-COMPLETE PROBLEMS The Tree of Intractability - Aaron
- ITERATION AND RECURSION The Towers of Hanoi - Dylan
- VLSI COMPUTERS Circuits in Silicon - Dylan
- THE HALTING PROBLEM The Uncomputable - Sam Leeman-Munk
- COMPUTER VIRUSES A Software Invasion - Brad
- LOGIC PROGRAMMING Prologue to Expertise - Nate
- RELATIONAL DATABASES Do-It-Yourself Queries - Samuel
Class Presentation Schedule
September 9
- Brad - Ch. 60: Computer Viruses
- Aaron - Ch. 42: Number Systems for Computing
September 16
- Sam L-M - Ch. 33: Analog Computation
- Dylan - Ch. 56: VLSI
September 23
- Sara Penhale - Where to find academically sound research materials (meet in Science Library)
September 30
- Sam W - Ch. 4: Simulation, The Monte Carlo Method (p.22)
- Nate - Ch 64: Logic Programming (p. 420)
October 7
- Brad - Ch. 6: Game Trees
- Aaron - Ch. 54: NP Complete Problems
October 14
- Sam L-M - Ch. 44: Cellular Automata
- Dylan -
October 21
- Sam W -
- Nate -
October 28
- Brad - Ch. 16: Genetic Algorithms (p.103)
- Aaron -
November 4
- Sam L-M -
- Dylan -
November 11
- Sam W -
- Nate -