index - Systèmes Parallèles

Mots-clés

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

 

Références bibliographiques

75

Dépôts avec texte intégral

107

Publications récentes

 

 

Cartographie des collaborations du LISN