index - Systèmes Parallèles

Mots-clés

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

 

Références bibliographiques

76

Dépôts avec texte intégral

106

Publications récentes

 

 

Cartographie des collaborations du LISN