Difference between revisions of "User:Dcg13"
Jump to navigation
Jump to search
| Line 7: | Line 7: | ||
== Grand Challenges for Engineering == | == Grand Challenges for Engineering == | ||
| − | [http://oilprice.com/Alternative-Energy/Solar-Energy/New-Technology-to-Reduce-Cost-of-Solar-Energy-by-75.html], Brian Westenhaus, OilPrice, 08/29/2012, 09/07/2012 (Grand Challenge) | + | [http://oilprice.com/Alternative-Energy/Solar-Energy/New-Technology-to-Reduce-Cost-of-Solar-Energy-by-75.html New Technology to Reduce Cost of Solar Energy], Brian Westenhaus, OilPrice, 08/29/2012, 09/07/2012 (Grand Challenge) |
== Matlab Demonstration == | == Matlab Demonstration == | ||
My favorite Matlab demonstration was the travelling salesman because of it's simplicity and usefulness. I liked messing around with the graphical program first, and then looking at the code and seeing how it ran. First, a random path is chosen between all of the cities. The distance of this path is calculated and the path is then optimized until the shortest path between all of the cities is found. | My favorite Matlab demonstration was the travelling salesman because of it's simplicity and usefulness. I liked messing around with the graphical program first, and then looking at the code and seeing how it ran. First, a random path is chosen between all of the cities. The distance of this path is calculated and the path is then optimized until the shortest path between all of the cities is found. | ||
Latest revision as of 18:41, 8 September 2012
About Me
Grand Challenges for Engineering
New Technology to Reduce Cost of Solar Energy, Brian Westenhaus, OilPrice, 08/29/2012, 09/07/2012 (Grand Challenge)
Matlab Demonstration
My favorite Matlab demonstration was the travelling salesman because of it's simplicity and usefulness. I liked messing around with the graphical program first, and then looking at the code and seeing how it ran. First, a random path is chosen between all of the cities. The distance of this path is calculated and the path is then optimized until the shortest path between all of the cities is found.
