Tractable Benchmarks For Constraint Programming by Petke, J, Jeavons, P

“…We therefore suggest that such families of instances may provide useful benchmarks for improving pre-processing and solving techniques.…”

Numerical inverse scattering for the Korteweg–-de Vries and modified Korteweg–-de Vries equations by Trogdon, T, Olver, S, Deconinck, B

“…Thus, this method can be used as a benchmarking tool for determining the effectiveness of future numerical methods designed to capture dispersion. …”

Multidimensional poverty and COVID-19 in Latin America and the Caribbean: recent trends and the route ahead by Moreno, H, Pinilla-Roncancio, M

“…This briefing analyses the most recent and up-to-date trends in multidimensional poverty in Latin America and the Caribbean (LAC) prior to the pandemic, which is essential for understanding both the progress made in the past and for use as a benchmark for the future. The briefing first presents the levels of multidimensional poverty in LAC according to the global Multidimensional Poverty Index (MPI) 2020.…”

Mixing Calculations in a Rotating Partitioned Pipe by Glasgow, C, Parrott, A

“…The Stokes representation provides us with a benchmark with which to assess the accuracy of the spline interpolants.…”

Inherent Limitations on Parallel Program Performance by Salamon, A, Neishlos, H

“…Using this we derive known bounds on performance in a systematic manner by comparing the structure of a program to benchmark structures for which performance can be easily determined. …”

Spectral method for the unsteady incompressible Navier-Stokes equations in gauge formulation by Tee, T, Sobey, I

“…Numerical results for the flow at Reynolds number Re = 1000 are presented, and compared to benchmark results. It is shown that the method, called the spectral gauge method, is straightforward to implement, and yields accurate solutions if Neumann boundary conditions are imposed on the gauge variable, but suffers from reduced convergence rates if Dirichlet boundary conditions are imposed on the gauge variable.…”

Adaptive Galerkin approximation algorithms for partial differential equations in infinite dimensions by Schwab, C, Suli, E

“…Specifically, for the infinite-dimensional FP equation, adaptive space-time Galerkin discretizations, based on a tensorized Riesz basis, built from biorthogonal piecewise polynomial wavelet bases in time and the Hermite polynomial chaos in the Wiener-Itô decomposition of $L^{2}(H,\mu)$, are introduced and are shown to converge quasioptimally with respect to the nonlinear, best $N$-term approximation benchmark. As a consequence, the proposed adaptive Galerkin solution algorithms perform quasioptimally with respect to the best $N$-term approximation in the finite-dimensional case, in particular. …”

A DC-programming algorithm for kernel selection by Argyriou, A, Hauser, R, Micchelli, C, Pontil, M

“…Our experimental results on benchmark data sets show that this algorithm outperforms a previously proposed method. …”

Global sustainable city-regions (2nd #MScGSCGlasgow edition): Stockholm, Berlin, Kolkata, Masdar, Bengaluru, Malawi, Belfast, Hong Kong, Seoul, Helsinki and Glasgow by Calzada, I

“…The MSc was developed in a team-based dynamic by applying qualitative action research methodologies to understand and interpret each case and to benchmark and contrast with other cases that addressed the same global urban issue. …”