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

Mots-clés

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

 

Références bibliographiques

76

Dépôts avec texte intégral

105

Publications récentes

 

 

Cartographie des collaborations du LISN