index - Systèmes Parallèles

Mots-clés

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

 

Références bibliographiques

77

Dépôts avec texte intégral

107

Publications récentes

 

 

Cartographie des collaborations du LISN