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

Mots-clés

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

 

Références bibliographiques

76

Dépôts avec texte intégral

105

Publications récentes

 

 

Cartographie des collaborations du LISN