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

Mots-clés

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

 

Références bibliographiques

76

Dépôts avec texte intégral

103

Publications récentes

 

 

Cartographie des collaborations du LISN