Suchergebnisse - "2.5D algorithms"
-
1
Minimizing Communication in All-Pairs Shortest Paths
ISBN: 146736066X, 9781467360661ISSN: 1530-2075Veröffentlicht: IEEE 01.05.2013Veröffentlicht in 2013 IEEE 27th International Symposium on Parallel and Distributed Processing (01.05.2013)“… We consider distributed memory algorithms for the all-pairs shortest paths (APSP) problem. Scaling the APSP problem to high concurrencies requires both …”
Volltext
Tagungsbericht -
2
Numerical simulation and dimension reduction analysis of electromagnetic logging while drilling of horizontal wells in complex structures
ISSN: 1672-5107, 1995-8226Veröffentlicht: Beijing China University of Petroleum (Beijing) 01.06.2020Veröffentlicht in Petroleum science (01.06.2020)“… Electromagnetic logging while drilling (LWD) is one of the key technologies of the geosteering and formation evaluation for high-angle and horizontal wells. In …”
Volltext
Journal Article

