Researchers from Chiba University have developed a lightweight peer-selection algorithm that significantly reduces data propagation delays without increasing resource usage on internet of things (IoT) ...

Based on the graphic theory and improved genetic algorithm,an improved genetic algorithm to search the minimum spanning trees is given . The algorithm uses binary code to represent the problem of ...

Euclidean Minimum Spanning Trees using single-, sesqui-, and dual-tree Borůvka algorithms – quite fast in spaces of low intrinsic dimensionality, Minimum spanning trees with respect to mutual ...

SAN FRANCISCO, Nov 20 (Reuters) - IBM (IBM.N), opens new tab and Cisco Systems (CSCO.O), opens new tab on Thursday said they plan to link quantum computers over long distances, with the goal of ...

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 ...

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 the easiest pieces first. But this kind of sorting has a cost.

A new study leveraging 20,000 tree-ring records and nearly 150 scientists' contributions from across the globe shows that, while droughts appear to have had a modest impact on tropical tree growth in ...

Abstract: The rapid expansion of Low Earth Orbit (LEO) satellite constellations presents new challenges for maintaining efficient inter-satellite communication under dynamic network topologies.

Quantum computers still can’t do much. Almost every time researchers have found something the high-tech machines should one day excel at, a classical algorithm comes along that can do it just as well ...