|
Discrete Global Minimization Algorithms
|
Discrete Global Minimization Algorithms
Steven Gortler demonstrates how global optima can be found as the limit of a set of purely combinatorial problems. These combinatorial problems can be thought of higher dimensional analogues of the 'shortest path in planar graph' problems. He explains how these combinatorial problems can be solved in polynomial time by reducing them to instances of MIN-CUT. From the Series:CSE Colloquia - 2005
Video Length: 3118
Date Found: February 12, 2009
Date Produced: January 04, 2005
View Count: 1
|
|
|
|
|
I got punched by an old guy, for farting near his wife. Read MoreComic book creator Stan Lee talks the future of the medium in the digital age. Panelists Zachary... Read MoreThe U.S. launch of Spotify is still on music lovers' minds. Join Zachary Levi, from NBC’s... Read MoreTuesday: Rupert Murdoch testifies before Parliament on the hacking scandal that brought down "News... Read MoreAfter a long slump, the home construction industry may be showing signs of life. But as Bill... Read More | 1 2 3 4 5 |
|
|
|