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

Mots-clés

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

 

Références bibliographiques

76

Dépôts avec texte intégral

105

Publications récentes

 

 

Cartographie des collaborations du LISN