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

Mots-clés

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

 

Références bibliographiques

75

Dépôts avec texte intégral

104

Publications récentes

 

 

Cartographie des collaborations du LISN