Skip to content ↓

Topic

Algorithms

Download RSS feed: News Articles / In the Media / Audio

Displaying 826 - 840 of 844 news articles related to this topic.
Show:
In these time-lapse photos, a robot is guided by two different algorithms as it attempts to grasp a coffee cup on a desk. In the first (top), the robot flails about randomly before reaching toward the cup. But when it runs a new algorithm designed by MIT researchers (bottom), its movements are much more efficient and predictable.

Smarter robot arms

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

Read full story

Safer skies

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

Read full story

A graph is a group of vertices (circles) connected by edges (lines); a maximal independent set is a group of vertices (glowing circles), unconnected to each other, at least one of which <i>is</i> connected to any vertex omitted from the group.

Targeted results

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

Read full story

No backtalk

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

Read full story

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.

Read full story