![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Journal of Computational Science, Volume 33
Volume 33, April 2019
- Yann Thorimbert, Jonas Lätt, Bastien Chopard:
Coupling of lattice Boltzmann shallow water model with lattice Boltzmann free-surface model. 1-10
- Yali Peng, Shigang Liu, Yongqian Qiang, Xiaojun Wu, Ling Hong:
A local mean and variance active contour model for biomedical image segmentation. 11-19
- Rocío Carratalá-Sáez
, Sven Christophersen, José Ignacio Aliaga
, Vicenç Beltran
, Steffen Börm, Enrique S. Quintana-Ortí:
Exploiting nested task-parallelism in the H-LU factorization. 20-33 - Filip Pawlowski
, Bora Uçar
, Albert-Jan Yzelman:
A multi-dimensional Morton-ordered block storage for mode-oblivious tensor computations. 34-44 - Cheng Cao, Hong-Quan Chen, Jia-Le Zhang
, Shengguan Xu
:
A multi-layered point reordering study of GPU-based meshless method for compressible flow simulations. 45-60 - Majid Forghani-elahabad
, Nelson Kagan
:
An approximate approach for reliability evaluation of a multistate flow network in terms of minimal cuts. 61-67 - Simon Scheidegger, Ilias Bilionis
:
Machine learning for high-dimensional dynamic stochastic economies. 68-82
- Artur Malinowski
, Pawel Czarnul
:
Multi-agent large-scale parallel crowd simulation with NVRAM-based distributed cache. 83-94 - Shashi Jain
, Álvaro Leitao, Cornelis W. Oosterlee:
Rolling Adjoints: Fast Greeks along Monte Carlo scenarios for early-exercise options. 95-112
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.