![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Advances in Engineering Software, Volume 133
Volume 133, July 2019
- Guanghui Zhou, Xiongjun Yang, Chao Zhang
, Zhi Li, Zhongdong Xiao:
Deep learning enabled cutting tool selection for special-shaped machining features of complex products. 1-11 - Kazuki Hayashi
, Makoto Ohsaki
:
FDMopt: Force density method for optimal geometry and topology of trusses. 12-19 - Xiaofei Wan, Xiandong Liu, Yingchun Shan, Er Jiang, Haiwen Yuan:
Numerical and experimental investigation on the effect of tire on the 13° impact test of automotive wheel. 20-27 - Giuliano Vernengo
, Luca Bonfiglio:
A Computational framework to design optimally loaded supercavitating hydrofoils by differential evolution algorithm and a new viscous lifting line method. 28-38 - Adrian R. G. Harwood
:
GPU-powered, interactive flow simulation on a peer-to-peer group of mobile devices. 39-51 - José A. López-Campos, Abraham Segade
, Enrique Casarejos, José R. Fernández, Gustavo R. Días:
Hyperelastic characterization oriented to finite element applications using genetic algorithms. 52-59 - Deborah Briccola
, Matteo Bruggi
:
Analysis of 3D linear elastic masonry-like structures through the API of a finite element software. 60-75 - V. Partimbene, Thierry Garcia
, Pierre Spitéri, Philippe Marthon, L. Ratsifandrihana:
Asynchronous multi-splitting method for linear and pseudo-linear problems. 76-95
![](https://dblp.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.