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

Mots-clés

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

 

Références bibliographiques

76

Dépôts avec texte intégral

105

Publications récentes

 

 

Cartographie des collaborations du LISN