‘Smart cars’ that are actually, well, smart
Mechanical engineers work to develop intelligent onboard transportation systems that can prevent car crashes.
Honing household helpers
MIT computer scientists work toward improving robots’ ability to plan and perform complex actions, domestically and elsewhere.
Speeding swarms of sensor robots
A new algorithm ensures that robotic environmental sensors will be able to focus on areas of interest without giving other areas short shrift.
Targeted results
By envisioning data as 'graphs,' MIT researchers show how to find local solutions to otherwise overwhelmingly complex problems.
No backtalk
One key to making parallel algorithms efficient is to minimize the amount of communication between cores.
Retooling algorithms
Charles Leiserson and his team are experts at designing parallel algorithms — including one for a chess-playing program that outperformed IBM’s Deep Blue.
Turning reviews into ratings
A new system automatically combs through online reviews to provide recommendations according to unusual criteria.
Breaking bottlenecks
A new algorithm enables much faster dissemination of information through self-organizing networks with a few scattered choke points.
First improvement of fundamental algorithm in 10 years
The max-flow problem, which is ubiquitous in network analysis, scheduling, and logistics, can now be solved more efficiently than ever.
Cars as traffic sensors
A new algorithm optimizes the dissemination of information about traffic and road conditions through networks of wirelessly connected cars.
