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

Mots-clés

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

 

Références bibliographiques

76

Dépôts avec texte intégral

103

Publications récentes

 

 

Cartographie des collaborations du LISN