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

Mots-clés

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

 

Références bibliographiques

76

Dépôts avec texte intégral

105

Publications récentes

 

 

Cartographie des collaborations du LISN