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

Mots-clés

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

 

Références bibliographiques

76

Dépôts avec texte intégral

105

Publications récentes

 

 

Cartographie des collaborations du LISN