Friday, February 5, 2010 - 3:00pm
1 hour (actually 50 minutes)
Refreshments in Room 2222, Klaus Building from 2-3 PM.
Simple, distributed and iterative algorithms, popularly known as the message passing algorithms, have emerged as the architecture of choice for engineered networks as well as cannonical behavioral model for societal and biological networks. Despite their simplicity, message passing algorithms have been surprisingly effective. In this talk, I will try to argue in favor of such algorithms by means of two results in the context of designing efficient medium access in wireless networks and modeling agent behavior in road transportation networks. See the full abstract,