Multiplicative programming problems are characterised by objective functions or constraints that involve products of decision variables, giving rise to nonconvex landscapes with multiple local optima.

Analog-to-digital conversion methods abound, but we are going to take a look at a particular approach as shown in Figure 1. Figure 1 An analog-to-digital converter where an analog input signal is ...

Note: The article usage is presented with a three- to four-day delay and will update daily once available. Due to ths delay, usage data will not appear immediately following publication. Citation ...

Abstract: We solve the convergence case of the generalized Baker–Schmidt problem for simultaneous approximation on affine subspaces, under natural diophantine type conditions. In one of our theorems, ...

This paper presents an analysis of properties of two hybrid discretisation methods for Gaussian derivatives, based on convolutions with either the normalised sampled Gaussian kernel or the integrated ...

Samiedaluie, Saied; Zhang, Dan; Zhang, Rui. Approximate linear programming for a queueing control problem. Computers & Operations Research. Sep2024, Vol. 169, pN.PAG ...

Admission decisions for loss systems accessed by multiple customer classes are a classical queueing control problem with a wide variety of applications. When a server is available, the decision is ...

In recent years, neural networks have once again triggered an increased interest among researchers in the machine learning community. So-called deep neural networks model functions using a composition ...