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

Mots-clés

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

 

Références bibliographiques

76

Dépôts avec texte intégral

103

Publications récentes

 

 

Cartographie des collaborations du LISN