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

Mots-clés

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

 

Références bibliographiques

76

Dépôts avec texte intégral

103

Publications récentes

 

 

Cartographie des collaborations du LISN