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

Mots-clés

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

 

Références bibliographiques

76

Dépôts avec texte intégral

103

Publications récentes

 

 

Cartographie des collaborations du LISN