index - Systèmes Parallèles

Mots-clés

65Y05 Generative programming FMI standard 65Y10 Randomization Asymptotic consensus Quantum computation Localization Theory of computation → Distributed algorithms ADI High-performance computing CP decomposition Approximate consensus Linear systems Optimization Linear least squares Exact space complexity Mobile Agents 65F45 Partial diagonalization SIMD Condition number Système complexe Population protocols Compilation B7 Graph algorithms Gathering B0 Interval analysis GPU GPU computing Benchmark Mobile agents Deterministic algorithms Machine learning Performance Tight lower bounds Qubit Mixed precision algorithms Parallel computing Quantum computing Clock synchronization Wireless sensor network Graphics processing units Treasure Hunt Spectral clustering Signaux Sismiques Wireless networks ARMS Randomized algorithms Deterministic naming ADI method Interference control Time complexity Leader election Beeping model Deep Learning Hardware Architecture csAR Programmation générique Evaporation Search Low-rank approximations Navier-Stokes equations Connected component analysis Linear reversible circuits Distributed Algorithms Modèles de diffusions Dynamic networks Domain-specific language Parallel skeletons Oblivious message adversaries LSCR Networks of passively mobile agents Consensus Parallel code optimization Tucker decomposition Self-stabilization Lower bounds Distributed algorithms C++ Pheromone MAGMA library Calcul haute performance Scheduling Generic programming SIMD extension LU factorization Global and weak fairness Iterative refinement Exploration Approximation Networks Costs Programmation générative HPC Statistical condition estimation Emerging Technologies csET FOS Computer and information sciences 65F55

 

Références bibliographiques

75

Dépôts avec texte intégral

107

Publications récentes

 

 

Cartographie des collaborations du LISN