When most people hear "polymer," they think of plastics. In our group, polymerization is a way to line up identical molecules like beads on a string and let quantum mechanics take over. Put magnetic ...

The graph coloring problem involves coloring the nodes of a graph using the minimum number of colors such that no two adjacent nodes share the same color. This NP-hard problem has various real-world ...

Descriptive set theorists study the niche mathematics of infinity. Now, they’ve shown that their problems can be rewritten in the concrete language of algorithms. All of modern mathematics is built on ...

ABSTRACT: A new nano-based architectural design of multiple-stream convolutional homeomorphic error-control coding will be conducted, and a corresponding hierarchical implementation of important class ...

block-insertion-theorem is a reproducible reference implementation of a combinatorial result about block insertion and counting linear extensions of posets. The repository provides a formal JSON ...

Sudanese lawyers on Thursday demanded that authorities release five miners arrested last April from a civilian mining site in the northern city of Abu Hamad without facing any charges...Sudanese ...

Abstract: This paper investigates a fully distributed federated learning (FL) problem, in which each device is restricted to only utilize its local dataset and the information received from its ...

The original version of this story appeared in Quanta Magazine. Computer scientists often deal with abstract problems that are hard to comprehend, but an exciting new algorithm matters to anyone who ...

Graph theory is an integral component of algorithm design that underlies sparse matrices, relational databases, and networks. Improving the performance of graph algorithms has direct implications to ...

ABSTRACT: This study presents a two-echelon inventory routing problem (2E-IRP) with an end-of-tour replenishment (ETR) policy whose distribution network consists of a supplier, several distribution ...