Combinatorial optimization problems are often encountered in real-world applications, including logistics, scheduling and ...

Abstract: This paper focuses on the covariance-based activity detection problem in a multi-cell massive multiple-input multiple-output (MIMO) system. In this system, active devices transmit their ...

OpenAI is acquiring Ona to give Codex persistent cloud environments, allowing AI agents to continue working on tasks long after users leave a session. OpenAI's acquisition of Ona aims to enhance Codex ...

AI algorithms exhibit racial bias in job candidate screening, and they discriminate more frequently against those applying for multiple jobs at different companies, according to Stanford-led ...

As the world races to build artificial superintelligence, one maverick bioengineer is testing how much unprogrammed intelligence may already be lurking in our simplest algorithms to determine whether ...

Abstract: Most existing random access schemes for machine-type communications (MTC) simply adopt a uniform preamble selection distribution, irrespective of the underlying device activity distributions ...

Download PDF Join the Discussion View in the ACM Digital Library The maximum flow problem and its generalization, the minimum-cost flow problem, are classic combinatorial graph problems that find ...

Finding bipartite matchings is one of the oldest and most well-studied problems in computer science. This problem comes up in many guises, such as when matching donors to recipients for organ ...