Determining the least expensive path for a new subway line underneath a metropolis like New York City is a colossal planning challenge—involving thousands of potential routes through hundreds of city ...

We publish the best academic work (that's too often lost to peer reviews & the TA's desk) to the global tech community ...

The original version of this story appeared in Quanta Magazine. If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle ...

Researchers have successfully used a quantum algorithm to solve a complex century-old mathematical problem long considered impossible for even the most powerful conventional supercomputers. The ...

The original version of this story appeared in Quanta Magazine. For computer scientists, solving problems is a bit like mountaineering. First they must choose a problem to solve—akin to identifying a ...

Abstract: The Steiner Forest Problem is a fundamental combinatorial optimization problem in operations research and computer science. Given an undirected graph with non-negative weights for edges and ...

ABSTRACT: In this paper we compare track data association purity, accuracy, and timing on a simple, idealized model tracking problem for two data association methods: Global Nearest Neighbor (GNN) and ...

The distributed hybrid flowshop scheduling problems (DHFSPs) widely exist in various industrial production processes, and thus have received widespread attention. However, the existing research mainly ...

Fast-DiM Uses second-order multistep ODE solver to solve the PF ODE to reduce NFE Fast-DiM-ode Same as Fast-DiM plus an improved formulation to solve the PF ODE forwards in time, resulting in reduced ...