index - Systèmes Parallèles

Mots-clés

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

 

Références bibliographiques

75

Dépôts avec texte intégral

115

Publications récentes

 

 

Cartographie des collaborations du LISN