Suchergebnisse - 68W10 Parallel algorithms in computer science*

Parallel homological calculus for 3D binary digital images von Díaz-del-Río, Fernando, Molina-Abril, Helena, Real, Pedro, Onchis, Darian, Blanco-Trejo, Sergio

“… Within the cubical-voxel 3D binary image context, we design an algorithm for computing the isotopic model of an image, called ( 6 , 26 …”
Volltext

Parallel algorithm portfolios with performance forecasting von Souravlias, D., Kotsireas, I. S., Pardalos, P. M., Parsopoulos, K. E.

“… The predictions are used to allocate computational resources to the algorithms, accordingly. The proposed model is demonstrated on parallel algorithm portfolios consisting …”
Volltext

Evaluation of automatic parallelization algorithms to minimize speculative parallelism overheads: An experiment von Kumar, Sudhakar, Singh, Sunil Kr, Aggarwal, Naveen, Aggarwal, Kriti

“… Automatic parallelization is a crucial objective of the parallel computing architecture that can be achieved through conversion of sequential code into multi-threaded code, which will run in parallel manner …”
Volltext

Linear Matroid Intersection is in Quasi-NC von Gurjar, Rohit, Thierauf, Thomas

“… In case of linear matroids, the problem had a randomized parallel algorithm but no deterministic one …”
Volltext

An improved multistage preconditioner on GPUs for compositional reservoir simulation von Zhao, Li, Li, Shizhe, Zhang, Chen-Song, Feng, Chunsheng, Shu, Shi

“… Numerical results demonstrate that the proposed algorithm achieves good parallel speedup while yielding the same convergence behavior as the corresponding sequential version …”
Volltext

Hybrid projection methods for equilibrium problems with non‐Lipschitz type bifunctions von Van Hieu, Dang

“… The linesearch used in the proposed algorithms has allowed to reduce some conditions imposed on equilibrium bifunctions …”
Volltext

Fast reconfiguration algorithms for time, space, and wavelength dilated optical Benes networks von Lu, Enyue, Zheng, S. Q.

“… In this paper, we present polylogarithmic-time reconfiguration algorithms for realizing any (partial) permutation in time, space and wavelength dilated optical Benes networks using a linear number of processors …”
Volltext

Soft-computing approach to solve ill-posed inverse problems: application to random materials and imperfect cylindrical shells von Patelli, Edoardo, Schuëller, Gerhart I.

“… The HSO tool combines genetic algorithms, simulated annealing and taboo list. One of the key features of the proposed approach is the possibility of identifying multiple solutions that satisfy the 'forward' model …”
Volltext

Parallel coordinate descent methods for big data optimization von Richtarik, Peter, TakaAe, Martin

“… on the number of parallel processors and a natural and easily computable measure of separability of the smooth component of the objective function …”
Volltext

A fast parallel max-flow algorithm von Peretz, Yossi, Fischler, Yigal

“… A new parallel algorithm for the max-flow problem on directed networks with single-source and single-sink is proposed …”
Volltext

Asynchronous parallel algorithms for nonconvex optimization von Cannelli, Loris, Facchinei, Francisco, Kungurtsev, Vyacheslav, Scutari, Gesualdo

“… We propose a new asynchronous parallel block-descent algorithmic framework for the minimization of the sum of a smooth nonconvex function and a nonsmooth convex one, subject to both convex and nonconvex constraints …”
Volltext

A parallel and distributed C4.5 algorithm in cloud computing environments: A parallel and distributed C4.5 algorithm von Lin, Kawuu W., Zheng, Ya-Jun, Chen, Ju-Chin, Wang, Wei-Chiang, Chen, Chao-Chun

“… Among its tasks, classification is one of the most essential, with decision tree algorithms being a widely adopted solution due to their efficiency in addressing association rules and classification challenges …”
Volltext

p4est : Scalable Algorithms for Parallel Adaptive Mesh Refinement on Forests of Octrees von Burstedde, Carsten, Wilcox, Lucas C., Ghattas, Omar

“… (ProQuest: ... denotes formulae/symbols omitted.)The authors present scalable algorithms for parallel adaptive mesh refinement and coarsening (AMR …”
Volltext

Parallel Extragradient-Proximal Methods for Split Equilibrium Problems von Hieua, Dang Van

“… In this paper, we introduce two parallel extragradient-proximal methods for solving split equilibrium problems …”
Volltext

Parallel evolutionary test case generation for web applications von Wang, Weiwei, Wu, Shumei, Li, Zheng, Zhao, Ruilian

“… Furthermore, premature convergence is a problem for evolutionary algorithms because of the decline of population diversity …”
Volltext

Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries von Erlebach, Thomas, Hoffmann, Michael, de Lima, Murilo Santos

“… ). We introduce a new model where  k queries can be made in parallel in each round, and the goal is to minimize the number of query rounds …”
Volltext

Observations in applying Bayesian versus evolutionary approaches and their hybrids in parallel time-constrained optimization von Gobert, Maxime, Briffoteaux, Guillaume, Gmys, Jan, Melab, Nouredine, Tuyttens, Daniel

“… Parallel Surrogate-Based Optimization (PSBO) is an efficient approach to deal with black-box time-consuming objective functions …”
Volltext

Scalable parallel finite volume lattice Boltzmann method for thermal incompressible flows on unstructured grids von Xu, Lei, Chen, Rongliang

“… •The proposed algorithm scales up to 6000 processor cores with 96.50% parallel efficiency for a case with over 5 billion unstructued grid cells …”
Volltext

A parallel structured banded DC algorithm for symmetric eigenvalue problems von Li, Shengguo, Liao, Xia, Lu, Yutong, Roman, Jose E., Yue, Xiaoqiang

“… In this paper, a novel parallel structured divide-and-conquer (DC) algorithm is proposed for symmetric banded eigenvalue problems, denoted by PBSDC, which modifies the classical parallel banded DC (PBDC …”
Volltext

Low-rank Parareal: a low-rank parallel-in-time integrator von Carrel, Benjamin, Gander, Martin J., Vandereycken, Bart

“… In this work, the Parareal algorithm is applied to evolution problems that admit good low-rank approximations and for which the dynamical low-rank approximation (DLRA …”
Volltext