共 50 条
- [41] A divide-and-conquer algorithm of Delaunay triangulation with GPGPU 2012 FIFTH INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS AND PROGRAMMING (PAAP), 2012, : 175 - 177
- [42] Engineering the Divide-and-Conquer Closest Pair Algorithm Journal of Computer Science and Technology, 2007, 22 : 532 - 540
- [43] Efficient divide-and-conquer multiprecision integer division IEEE 22nd Symposium on Computer Arithmetic ARITH 22, 2015, : 90 - 95
- [45] AN IMPLEMENTATION OF A DIVIDE-AND-CONQUER ALGORITHM FOR THE UNITARY EIGENPROBLEM ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1992, 18 (03): : 292 - 307
- [46] A general and efficient divide-and-conquer algorithm framework for multi-core clusters Cluster Computing, 2017, 20 : 2605 - 2626
- [47] A general and efficient divide-and-conquer algorithm framework for multi-core clusters CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2017, 20 (03): : 2605 - 2626
- [48] A parallel processing method of divide-and-conquer and a highly efficient parallel sorting algorithm DCABES 2006 Proceedings, Vols 1 and 2, 2006, : 86 - 88
- [50] GENERALIZED ORTHOGONAL COMPLEMENT BASED DIVIDE AND CONQUER ALGORITHM FOR CONSTRAINED MULTIBODY DYNAMICS PROCEEDINGS OF ASME INTERNATIONAL DESIGN ENGINEERING TECHNICAL CONFERENCES AND COMPUTERS AND INFORMATION IN ENGINEERING CONFERENCE, VOL 4, PTS A-C, 2010, : 121 - 127