Algorithms

Self-sculpting sandNew algorithms could enable heaps of ‘smart sand’ that can assume any shape, allowing spontaneous formation of new tools or duplication of broken mechanical parts.

Robots go head to head, 250 miles above EarthThird annual Zero Robotics competition pits robots against each other on the International Space Station.

Data mining without prejudiceA new technique for finding relationships between variables in large datasets makes no prior assumptions about what those relationships might be.

Double dutyA computational biologist and physician, Collin Stultz takes a unique approach to studying diseases that could lead to new treatments.

At a crossroadsNew research predicts which cars are likeliest to run lights at intersections.

New algorithm could substantially speed up MRI scansFaster scans could reduce the time patients spend in the machine from 45 to 15 minutes.

Smarter robot armsA combination of two algorithms developed at MIT allows autonomous robots to execute tasks much more efficiently — and move more predictably.

Andrew Lo joins CSAILEconomist hopes to merge the fields of computer science and artificial intelligence with research on financial markets and risk.

Milestone for MIT Press’s bestsellerWhat 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 imagingA simple new imaging system could help manufacturers inspect their products, forensics experts identify weapons and doctors identify cancers.

Clearing the decksA new planning tool helps direct traffic on aircraft carriers.

Safer skiesA new algorithm could help prevent midair collisions, which involve 10 to 12 small aircraft every year.

The math of the Rubik’s cubeNew 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, smartMechanical engineers work to develop intelligent onboard transportation systems that can prevent car crashes.

Honing household helpersMIT computer scientists work toward improving robots’ ability to plan and perform complex actions, domestically and elsewhere.

Speeding swarms of sensor robotsA new algorithm ensures that robotic environmental sensors will be able to focus on areas of interest without giving other areas short shrift.

Targeted resultsBy envisioning data as 'graphs,' MIT researchers show how to find local solutions to otherwise overwhelmingly complex problems.

No backtalkOne key to making parallel algorithms efficient is to minimize the amount of communication between cores.

Retooling algorithmsCharles 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 ratingsA new system automatically combs through online reviews to provide recommendations according to unusual criteria.

Breaking bottlenecksA 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 yearsThe max-flow problem, which is ubiquitous in network analysis, scheduling, and logistics, can now be solved more efficiently than ever.

Cars as traffic sensorsA new algorithm optimizes the dissemination of information about traffic and road conditions through networks of wirelessly connected cars.