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

Mots-clés

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

 

Références bibliographiques

76

Dépôts avec texte intégral

105

Publications récentes

 

 

Cartographie des collaborations du LISN