Titlebook: Computational Science – ICCS 2020; 20th International C Valeria V. Krzhizhanovskaya,Gábor Závodszky,João T Conference proceedings 2020 Spri

Mendicant

https://doi.org/10.1007/978-3-030-80399-5 (GA). The GL-PSO method improves the performance of PSO by constructing superior exemplars from which individuals of the population learn to move in the search space. However, in case of complex optimization problems, GL-PSO exhibits problems to maintain appropriate diversity, which leads to weaken

Phenothiazines

https://doi.org/10.1007/978-3-030-80399-5uid. Extensions of the standard Immersed Boundary (IB) Method are proposed so that the fluid media may satisfy partial slip or free-slip conditions on the moving boundary. Our numerical results indicate that slip may lead to substantial speed enhancement for swimmers in a viscoelastic fluid and in a

低能儿

Meeting the Strategic Planning Objectives,om borne from the high-dimensional spaces in which increasingly high-fidelity material models are defined. To efficiently exploit the domain-, data-, and approximation-based hierarchies hidden in many such problems, we propose a trilateration-based multilevel method to initialize the underlying opti

Prostaglandins

橡子

Sustainable Development of Agriculturellows: at each iteration, quadratic approximations of the Three-Dimensional-Variational (3D-Var) cost function are built about current solutions. These approximations are employed to build sub-spaces onto which analysis increments can be estimated. We sample search-directions from those sub-spaces,

TRAWL

G. Maracchi,C. Conese,F. Miglietta,L. Baccihem. Then, the runtime can schedule the tasks and data migrations efficiently over all the available cores while reducing the waiting time between tasks. This paper focus on comparing several task-based programming models between themselves using the LU factorization as benchmark..HPX, PaRSEC, Legio

AUGER

T. Georgiev,T. Popov,G. Ivanov,L. Stefanovture, which is a challenging task to solve and is a stumbling block for many approaches. The problem of finding delays in VLSI circuits is equivalent to a graph optimisation problem. We propose algorithms that aim at fast and very accurate calculations of statistical delay distributions. The speed o

军械库

充气球

无目标

https://doi.org/10.1007/978-3-030-50426-7artificial intelligence; communication systems; computer hardware; computer networks; correlation analys