Zobrazeno 1 - 10
of 892
pro vyhledávání: '"Analysis of parallel algorithms"'
A parallel naive approach for non-dominated sorting: a theoretical study considering PRAM CREW model
Autor:
Carlos A. Coello Coello, Sumit Mishra
Publikováno v:
Soft Computing. 25:73-84
Pareto-based multi-objective evolutionary algorithms use non-dominated sorting as an intermediate step. These algorithms are easy to parallelize as various steps of these algorithms are independent of each other. Researchers have focused on the paral
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c8e58ad675ba1edccded1c8e0f7ba8de
https://doi.org/10.1007/s00500-020-05450-1
https://doi.org/10.1007/s00500-020-05450-1
Autor:
David Simchi-Levi, Will Ma
Publikováno v:
Operations Research. 68:1787-1803
Motivated by the dynamic assortment offerings and item pricings occurring in e-commerce, we study a general problem of allocating finite inventories to heterogeneous customers arriving sequentially. We analyze this problem under the framework of comp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::222fd11a186ccea820f538e796d6c704
https://doi.org/10.1287/opre.2019.1957
https://doi.org/10.1287/opre.2019.1957
Publikováno v:
ICPP Workshops
The Parallel Random Access Machines (PRAM) abstraction is the simplest and most elegant algorithmic model for the design and analysis of parallel algorithms. It consists of different models categorized based on the underlying memory access mode used,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9c5428122645998539859537c73bf612
https://doi.org/10.1145/3458744.3474041
https://doi.org/10.1145/3458744.3474041
Publikováno v:
SPAA
As computational resources become more efficient and data sizes grow, data movement is fast becoming the dominant cost in computing. Processing-in-Memory is emerging as a key technique for reducing costly data movement, by enabling computation to be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dbd0b2740662b97191152f9bfc5f2f3a
https://doi.org/10.1145/3409964.3461816
https://doi.org/10.1145/3409964.3461816
Autor:
Carlos A. Coello Coello, Sumit Mishra
Publikováno v:
Journal of Heuristics. 25:455-483
Non-dominated sorting is a crucial component of Pareto-based multi- and many-objective evolutionary algorithms. As the number of objectives increases, the execution time of a multi-objective evolutionary algorithm increases, too. Since multi-objectiv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ffae52ad24f93da76c928aea5198386f
https://doi.org/10.1007/s10732-019-09407-y
https://doi.org/10.1007/s10732-019-09407-y
Publikováno v:
COMPUTING AND INFORMATICS; Vol. 38 No. 4 (2019): Computing and Informatics; 817-850
Computing and informatics 38 (2019): 817–850. doi:10.31577/cai_2019_4_817
info:cnr-pdr/source/autori:D'Amore, Luisa; Mele, Valeria; Romano, Diego; Laccetti, Giuliano/titolo:Multilevel Algebraic Approach for Performance Analysis of Parallel Algorithms/doi:10.31577%2Fcai_2019_4_817/rivista:Computing and informatics/anno:2019/pagina_da:817/pagina_a:850/intervallo_pagine:817–850/volume:38
Computing and informatics 38 (2019): 817–850. doi:10.31577/cai_2019_4_817
info:cnr-pdr/source/autori:D'Amore, Luisa; Mele, Valeria; Romano, Diego; Laccetti, Giuliano/titolo:Multilevel Algebraic Approach for Performance Analysis of Parallel Algorithms/doi:10.31577%2Fcai_2019_4_817/rivista:Computing and informatics/anno:2019/pagina_da:817/pagina_a:850/intervallo_pagine:817–850/volume:38
In order to solve a problem in parallel we need to undertake the fundamental step of splitting the computational tasks into parts, i.e. decomposing the problem solving. A whatever decomposition does not necessarily lead to a parallel algorithm with t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0cd156e754dce784e8f59b37a0efcca0
https://doi.org/10.31577/cai_2019_4_817
https://doi.org/10.31577/cai_2019_4_817
Publikováno v:
Science. 7/30/1993, Vol. 261 Issue 5121, p630. 2/3p.
Publikováno v:
Communications in Computer and Information Science ISBN: 9783030646158
RuSCDays
RuSCDays
The paper describes the system of mass practical assignments formed in the framework of the course “Supercomputing Simulation and Technologies” at the Faculty of Computational Mathematics and Cybernetics at Lomonosov Moscow State University. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3c7dcfc5582dc2925ff7b6fa5ef7d785
https://doi.org/10.1007/978-3-030-64616-5_45
https://doi.org/10.1007/978-3-030-64616-5_45
Publikováno v:
IEEE Robotics and Automation Letters. 3:203-209
This letter proposes a unified GPU-parallelizable approach for robot forward dynamics (FD) computation based on the key fact that parallelism of prevailing FD algorithms benefits from the essential band sparsity of the joint space inertia (JSI) matri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f0e6b2a6b08a28247919717f927c28ba
https://doi.org/10.1109/lra.2017.2735479
https://doi.org/10.1109/lra.2017.2735479
Autor:
Isha Singhal, Barkha Khatri, Ajay Kumar Gupta, Naveen Kumar, Shikha Gupta, Stuti Mittal, Tamanna Gupta
Publikováno v:
Applied Soft Computing. 61:331-353
The world around us may be viewed as a network of entities interconnected via their social, economic, and political interactions. These entities and their interactions form a social network. A social network is often modeled as a graph whose nodes re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::271b4379e3cd3d8645278af4e3ea9171
https://doi.org/10.1016/j.asoc.2017.07.035
https://doi.org/10.1016/j.asoc.2017.07.035