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

Mots-clés

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

 

Références bibliographiques

75

Dépôts avec texte intégral

105

Publications récentes

 

 

Cartographie des collaborations du LISN