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

Mots-clés

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

 

Références bibliographiques

76

Dépôts avec texte intégral

105

Publications récentes

 

 

Cartographie des collaborations du LISN