This work introduces an approach for precisely designing surface friction properties using a conditional generative machine learning model, specifically a denoising diffusion probabilistic model (DDPM ...

The travelling salesman problem (TSP) remains one of the most challenging NP‐hard problems in combinatorial optimisation, with significant implications for logistics, network design and route ...

An examination of antitrust and competition considerations relating to the use of pricing algorithms and other AI systems, including the relevant legal issues and how to design algorithms to ...

This letter proposes two polynomial-time approximation algorithms for allocating servers to design a consistency-aware multi-server network for delay-sensitive applications.

4 Applied Science Research Center, Applied Science Private University, Amman, Jordan 5 Department of Computer and Electrical Engineering, Mid Sweden University, Sundsvall, Sweden This paper proposes ...

This paper proposes a high-performance circuit design algorithm using input data dependent approximation. In our algorithm, STEPCs (Suspicious Timing Error Pred ...

The optimal design problem is specified in Section 3 with emphasis on the particularities and differences to optimal design of experiments in classical linear models. Subsequently, different ...

We present an artificial intelligence-guided approach to design durable and chemically recyclable ring-opening polymerization (ROP) class polymers. This approach employs a genetic algorithm (GA) that ...

Such algorithms find approximate (slightly suboptimal) solutions to optimization problems in polynomial time. Unlike heuristics, approximation algorithms have provable performance guarantees: they ...