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

Mots-clés

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

 

Références bibliographiques

75

Dépôts avec texte intégral

103

Publications récentes

 

 

Cartographie des collaborations du LISN