index - Systèmes Parallèles Accéder directement au contenu

Mots-clés

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

 

Références bibliographiques

76

Dépôts avec texte intégral

103

Publications récentes

 

 

Cartographie des collaborations du LISN