Difference between revisions of "User:Jmiller"
From REU@MU
| Line 8: | Line 8: | ||
*Attended various orientation events to become familiarized with Marquette campus, libraries, etc. | *Attended various orientation events to become familiarized with Marquette campus, libraries, etc. | ||
| − | *Began research on the Travelling Salesman Problem, and its application to Sudoku Distances | + | *Began research on the Travelling Salesman Problem, and its application to [[Sudoku Distances]] |
| − | *With [[User:Jbeilke|Julia]], wrote an algorithm for finding the optimal solution in the [[Sudoku Distances]] project for k = 3, and proved | + | *Began research on various distance metrics and their applications to [[Sudoku Distances]] |
| + | *With [[User:Jbeilke|Julia]], wrote an algorithm for finding the optimal solution in the [[Sudoku Distances]] project for k = 3, and proved its optimality | ||
Revision as of 17:04, 3 June 2016
Joel Miller studies Computer Science at Oberlin College in Ohio, and is part of the 2016 REU program Marquette. He is working on the Sudoku Distances project with Julia Beilke, advised by Dr. Kim Factor. In his free time, he enjoys rock climbing and making music.
Progress Log
Week 1 (5/31 - 6/3)
- Attended various orientation events to become familiarized with Marquette campus, libraries, etc.
- Began research on the Travelling Salesman Problem, and its application to Sudoku Distances
- Began research on various distance metrics and their applications to Sudoku Distances
- With Julia, wrote an algorithm for finding the optimal solution in the Sudoku Distances project for k = 3, and proved its optimality
