ACM Group Honors Research Team for Helping Computers Solve Practical Problems
AScribe Newswire (05/28/08)
ACM's Special Interest Group on Algorithms and Computing Theory (SIGACT) has named Yale University professor Daniel A. Spielman and Boston University professor Shang-Hua Teng the winners of the 2008 Godel Prize. Their paper, "Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time," helped explain the effectiveness of algorithms on real data and real computers for solving business and other practical problems. Spielman and Teng introduced the Smoothed Analysis in 2001, and the technique has served a key role in research efforts since then. Their findings were published in the Journal of the ACM in 2004. SIGACT and the European Association for Theoretical Computer Science (EATCS) will present Spielman and Teng with the award for outstanding papers in theoretical computer science at the International Colloquium on Automata, Languages, and Programming (ICALP), which takes place July 6-13, in Reykjavik, Iceland. The prize comes with a $5,000 award.
Click Here to View Full Article
No comments:
Post a Comment