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

Mots-clés

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

 

Références bibliographiques

76

Dépôts avec texte intégral

105

Publications récentes

 

 

Cartographie des collaborations du LISN