index - Systèmes Parallèles

Mots-clés

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

 

Références bibliographiques

76

Dépôts avec texte intégral

106

Publications récentes

 

 

Cartographie des collaborations du LISN