acm-header
Sign In

Communications of the ACM

News


Latest News News Archive Refine your search:
dateMore Than a Year Ago
subjectPerformance And Reliability
authorNeil Savage
bg-corner

An edited collection of advanced computing news from Communications of the ACM, ACM TechNews, other ACM resources, and news sites around the Web.


Always Improving Performance
From Communications of the ACM

Always Improving Performance

Jack J. Dongarra is the recipient of the 2021 ACM A.M. Turing Award for his pioneering contributions to numerical algorithms and libraries that enabled high-performance...

Virtual Duplicates
From Communications of the ACM

Virtual Duplicates

Digital twins aim to model reality so we can see how it changes.

Getting Down to Basics
From Communications of the ACM

Getting Down to Basics

2020 ACM A.M. Turing Award recipients Alfred Aho and Jeffrey Ullman helped develop formal language theory, invented efficient algorithms to drive the tasks of a...

Catching the Fakes
From Communications of the ACM

Catching the Fakes

Applying neural networks to images helps identify counterfeit goods.

Fact-Finding Mission
From Communications of the ACM

Fact-Finding Mission

Artificial intelligence provides automatic fact-checking and fake news detection, but with limits.

Tracking COVID, Discreetly
From Communications of the ACM

Tracking COVID, Discreetly

Tracing the contacts of those who come into contact with the coronavirus is not that simple.

Your Wish Is My CMD
From Communications of the ACM

Your Wish Is My CMD

Artificial intelligence could automate software coding.

Seeing Through Walls
From Communications of the ACM

Seeing Through Walls

Artificial intelligence makes sense of radio signals to understand what someone in another room is doing.

Neural Net Worth
From Communications of the ACM

Neural Net Worth

Yoshua Bengio, Geoffrey Hinton, and Yann LeCun this month will receive the 2018 ACM A.M. Turing Award for conceptual and engineering breakthroughs that have made...

Code Talkers
From Communications of the ACM

Code Talkers

Using voice input to write programs.

A New Movement in Seismology
From Communications of the ACM

A New Movement in Seismology

Unused telecom fiber might be used to detect earthquakes, uncover other secrets in the soil.

Rewarded for RISC
From Communications of the ACM

Rewarded for RISC

ACM A.M. Turing Award recipients David Patterson and John Hennessy developed the "dangerous" idea that software should be simpler so it can be executed more quickly...

Using Functions for Easier Programming
From Communications of the ACM

Using Functions for Easier Programming

Functional programming languages automate many of the details underlying specific operations.

Always Out of Balance
From Communications of the ACM

Always Out of Balance

Computational theorists prove there is no easy algorithm to find Nash equilibria, so game theory will have to look in new directions.

Going Serverless
From Communications of the ACM

Going Serverless

Serverless computing lets businesses and application developers focus on the program they need to run, without worrying about the machine on which it runs, or the...

A Block on the Old Chip
From Communications of the ACM

A Block on the Old Chip

Block copolymers may help transistors shrink to tinier dimensions.

Building a Brain May Mean Going Analog
From Communications of the ACM

Building a Brain May Mean Going Analog

Analog circuits consume less power per operation than CMOS technologies, and so should prove more efficient.

Lawmakers Seek to Expand Repair Options
From ACM News

Lawmakers Seek to Expand Repair Options

End-users want to be able to repair their expensive electronics; manufacturers disagree.

Weaving the Web
From Communications of the ACM

Weaving the Web

Sir Tim Berners-Lee created a paradigm shift that changed the world with his invention of the World Wide Web, Hypertext Transport Protocol, and Hypertext Markup...

Graph Matching in Theory and Practice
From Communications of the ACM

Graph Matching in Theory and Practice

A theoretical breakthrough in graph isomorphism excites complexity experts, but will it lead to any practical improvements?
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account