Dynamic Placement in Refugee Resettlement
In this paper, we design an online algorithm for refugee allocation.
Dynamic Placement in Refugee Resettlement
In this paper, we design an online algorithm for refugee allocation.
Technical Perspective: Improving Refugees’ Integration with Online Resource Allocation
"Dynamic Placement in Refugee Resettlement," by Narges Ahani et al., applies online resource allocation concepts to a new and important area: refugee resettlement.
Ensuring Business Continuity with Backup Cloud Storage Choices
Thoughts on AI Interoperability
Taming Algorithmic Priority Inversion in Mission-Critical Perception Pipelines
This paper discusses algorithmic priority inversion in mission-critical machine inference pipelines used in modern neural-network-based perception subsystems and describes a solution to mitigate its effect.
Technical Perspective: Bridging AI with Real-Time Systems
"Taming Algorithmic Priority Inversion in Mission-Critical Perception Pipelines," by Shengzhong Liu et al., proposes a new methodology for overcoming the limitations of current AI frameworks to enable the use of deep neural networks in mission-critical systems.
The Role of Autonomous Machine Computing in Shaping the Autonomy Economy
Governments Are Spying on Your Push Notifications
Protecting Life-Saving Medical Devices From Cyberattack
On Specifying for Trustworthiness
Achievement in Microarchitecture
Maximum Flow Through a Network: A Storied Problem and a Groundbreaking Solution
“Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow,” by Li Chen et al., comes within striking distance of answering the question: “Does maximum flow have a scalable algorithm?”
Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow
We present an algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with m edges and polynomially bounded integral demands, costs, and capacities in m1+o(1) time.
What Does Digitization Mean, and When Did It Begin?
All Photos are Fake Until Proven Real
Quantum Speedup for the Fast Fourier Transform?
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get InvolvedBy opening CACM to the world, we hope to increase engagement among the broader computer science community and encourage non-members to discover the rich resources ACM has to offer.
Learn More