Computer Scientists Find a Key Research Algorithm's Limits The most widely used technique for optimizing values of a math function turns out to be a fundamentally difficult computational problem.

The new algorithm handles changes consisting of deleted edges -- for example, if the equivalent of a stretch of a road suddenly becomes inaccessible due to roadworks.

In such cases, the fastest known shortest-path algorithm doesn’t work. For decades, fast algorithms for finding shortest paths on negative-weight graphs have remained elusive.

The researchers spun up an algorithm that finds similar images to a query. For example: “ which musical instrument is closest to this painting of a blue and white dress?” They found that ...

The algorithm worked with an accuracy of 0.999 and a precision of 0.9984. That’s significant because it sets up the possibility of an automated process for spotting “interesting” sequences.