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 ...
A team of computer scientists has come up with a dramatically faster algorithm for one of the oldest problems in computer science: maximum flow. The problem asks how much material can flow through a ...
The constrained two-dimensional cutting (C_TDC) problem consists of determining a cutting pattern of a set of n small rectangular piece types on a rectangular stock ...
A group of researchers at the Massachusetts Institute of Technology have devised a potentially more effective way of helping computers solve some of the toughest optimization problems they face. Their ...
The Journal of the Operational Research Society, Vol. 48, No. 8 (Aug., 1997), pp. 804-809 (6 pages) A new algorithm for the generalised assignment problem is described in this paper. The algorithm is ...
Computer scientists are abuzz over a fast new algorithm for solving one of the central problems in the field. (January 15, 2017, update: On January 4, Babai retracted ...
Machine learning is not new. We have witnessed it since the 1990s, when Amazon introduced a new “recommended for you” section for its users to display more personalized results. When we search for ...
Using machines to augment human activity is nothing new. Egyptian hieroglyphs show the use of horse-drawn carriages even before 300 B.C. Ancient Indian literature such as “Silapadikaram” has described ...
一些您可能无法访问的结果已被隐去。
显示无法访问的结果