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

Mots-clés

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

 

Références bibliographiques

76

Dépôts avec texte intégral

105

Publications récentes

 

 

Cartographie des collaborations du LISN