Smarter robot arms
A combination of two algorithms developed at MIT allows autonomous robots to execute tasks much more efficiently — and move more predictably.
Andrew Lo joins CSAIL
Economist hopes to merge the fields of computer science and artificial intelligence with research on financial markets and risk.
Milestone for MIT Press’s bestseller
What began as lecture notes for an MIT computer-science class has become the standard text in the field, selling half a million copies in 20 years.
Portable, super-high-resolution 3-D imaging
A simple new imaging system could help manufacturers inspect their products, forensics experts identify weapons and doctors identify cancers.
Safer skies
A new algorithm could help prevent midair collisions, which involve 10 to 12 small aircraft every year.
The math of the Rubik’s cube
New research establishes the relationship between the number of squares in a Rubik’s-cube-type puzzle and the maximum number of moves required to solve it.
‘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.