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

Mots-clés

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

 

Références bibliographiques

76

Dépôts avec texte intégral

Chargement de la page

Publications récentes

 

 

Cartographie des collaborations du LISN