Difference between revisions of "User:Esonmez"
| Line 1: | Line 1: | ||
Esonmez is a student at Duke University planning on studying computer science and electrical engineering. He enjoys playing tennis, running, and rooting for the 49ers & SF Giants in his "spare" time. | Esonmez is a student at Duke University planning on studying computer science and electrical engineering. He enjoys playing tennis, running, and rooting for the 49ers & SF Giants in his "spare" time. | ||
| + | ==Matlab Tutorials== | ||
| + | One of the more interesting tutorials on the Matlab Examples page is the "Traveling Salesman" tutorial. This tutorial is my favorite as it uses a graphical representation (of the places the salesman has to visit in the shortest time) to represent the algorithm that is running on MatLab. Since the traveling salesman problem is also an example of a NP problem (referring to the P vs. NP problem in computer science) and thus extremely inefficient to solve (for high iterations), the visual display helped as I could terminate the program after a certain amount of time and make logical modifications by looking at the map. | ||
| − | == Grand Challenges for Engineering | + | == Grand Challenges for Engineering== |
[http://www.economist.com/node/21528216 Fusion power: Next ITERation?], The Economist, created 3 September 2011, accessed 13 January 2014 (Provide Energy From Fusion) | [http://www.economist.com/node/21528216 Fusion power: Next ITERation?], The Economist, created 3 September 2011, accessed 13 January 2014 (Provide Energy From Fusion) | ||
Latest revision as of 04:47, 28 January 2014
Esonmez is a student at Duke University planning on studying computer science and electrical engineering. He enjoys playing tennis, running, and rooting for the 49ers & SF Giants in his "spare" time.
Matlab Tutorials
One of the more interesting tutorials on the Matlab Examples page is the "Traveling Salesman" tutorial. This tutorial is my favorite as it uses a graphical representation (of the places the salesman has to visit in the shortest time) to represent the algorithm that is running on MatLab. Since the traveling salesman problem is also an example of a NP problem (referring to the P vs. NP problem in computer science) and thus extremely inefficient to solve (for high iterations), the visual display helped as I could terminate the program after a certain amount of time and make logical modifications by looking at the map.
Grand Challenges for Engineering
Fusion power: Next ITERation?, The Economist, created 3 September 2011, accessed 13 January 2014 (Provide Energy From Fusion)
