Can any map be colored using just four colors? That is the question behind one of the most famous problems of mathematics, dating back to 1852. Since 1976, we have known that the answer is "yes"—but ...
Tensor contractions, generalized matrix multiplications that are time-consuming to calculate, make them among the most compute-intensive operations in several ab initio computational quantum chemistry ...
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 hybrid bi-level algorithm combines dream optimization and improved A* planning to generate shorter multi-target paths in ...
The Towers of Hanoi problem is well known and solved, but there are generalizations of it that still present some problems. Now we have an optimal algorithm for the 4-peg problem - can this be ...
A benchmark evaluation of multi-agent path finding algorithms identified MAPF-LNS2 as the most viable option for agricultural ...
The total amount of money invested in the project. The total cost includes EU contribution as well as other project costs not covered by EU funding. It is expressed in euros. Amount of money, by way ...
Synopsis: The authors systematically reviewed the literature and identified 18 different strategies for managing patients with suspected DVT. They evaluated a hypothetical group of 1,000 patients ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results