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