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

Mots-clés

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

 

Références bibliographiques

76

Dépôts avec texte intégral

105

Publications récentes

 

 

Cartographie des collaborations du LISN