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

Mots-clés

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

 

Références bibliographiques

76

Dépôts avec texte intégral

105

Publications récentes

 

 

Cartographie des collaborations du LISN