Copertina

Optimal Graph Stretching for Distributed Averaging

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Dekker, Florine W., Erkin, Zekeriya, Conti, Mauro
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Distributed, Parallel, and Cluster Computing Discrete Mathematics 68R10 (Primary) 05C38, 68W15, 90C59, 15B48, 05C50, 15A18, 05C65 (Secondary) G.1.6; C.2.4; D.4.8; I.6.6; D.2.8
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Next-Generation Event-Driven Architectures: Performance, Scalability, and Intelligent Orchestration Across Messaging Frameworks
di: Arafat, Jahidul, et al.
Pubblicazione: (2025)

Optimizing Multi-DNN Inference on Mobile Devices through Heterogeneous Processor Co-Execution
di: Gao, Yunquan, et al.
Pubblicazione: (2025)

Dirac's theorem and the switch geometry of perfect matchings
di: Kang, Ross J., et al.
Pubblicazione: (2026)

BALLAST: Bandit-Assisted Learning for Latency-Aware Stable Timeouts in Raft
di: Wang, Qizhi
Pubblicazione: (2025)

The Gallai Vertex Problem is $Θ_2^p$-Complete
di: Nikabadi, Amir, et al.
Pubblicazione: (2026)

Scalable Domain-decomposed Monte Carlo Neutral Transport for Nuclear Fusion
di: Lappi, Oskar, et al.
Pubblicazione: (2025)

An Empirical Evaluation of Quantum-Inspired QUBO Methods for Heterogeneous HPC Workflow Mapping and Scheduling
di: Sharma, Aasish Kumar, et al.
Pubblicazione: (2026)

Towards a conjecture on long induced rainbow paths in triangle-free graphs
di: Aravind, N. R., et al.
Pubblicazione: (2026)

Degree-preserving graph dynamics -- a versatile process to construct random networks
di: Erdős, Péter L., et al.
Pubblicazione: (2021)

Castling tree of tight Dyck nests with applications to odd and middle-levels graphs
di: Dejter, Italo J.
Pubblicazione: (2023)

The non-existence of some Moore polygons and spectral Moore bounds
di: Cioabă, Sebastian M., et al.
Pubblicazione: (2025)

FedDAF: Federated Domain Adaptation Using Model Functional Distance
di: Sen, Mrinmay, et al.
Pubblicazione: (2025)

Amnesiac Flooding: Easy to break, hard to escape
di: Austin, Henry, et al.
Pubblicazione: (2025)

Lindenmayer graph languages, first-order theories and expanders
di: Knapik, Teodor
Pubblicazione: (2024)

Multirate Stein Variational Gradient Descent for Efficient Bayesian Sampling
di: Sarshar, Arash
Pubblicazione: (2026)

Detecting and Preventing Latent Risk Accumulation in High-Performance Software Systems
di: Arafat, Jahidul, et al.
Pubblicazione: (2025)

optimize_anything: A Universal API for Optimizing any Text Parameter
di: Agrawal, Lakshya A, et al.
Pubblicazione: (2026)

Towards Resilient Intrusion Detection in CubeSats: Challenges, TinyML Solutions, and Future Directions
di: Fayyaz, Yasamin, et al.
Pubblicazione: (2026)

Minimal obstructions to $C_5$-coloring in hereditary graph classes
di: Goedgebeur, Jan, et al.
Pubblicazione: (2024)

Formal Probabilistic Methods for Combinatorial Structures using the Lovász Local Lemma
di: Edmonds, Chelsea, et al.
Pubblicazione: (2023)

Packing, Hitting, and Colouring Squares
di: Caoduro, Marco, et al.
Pubblicazione: (2022)

The Parity-Constrained Four-Peg Tower of Hanoi Problem and Its Associated Graph
di: Mehiri, El-Mehdi
Pubblicazione: (2025)

FlashSpread: IO-Aware GPU Simulation of Non-Markovian Epidemic Dynamics via Kernel Fusion
di: Shakeri, Heman, et al.
Pubblicazione: (2026)

Two-colorings of finite grids: variations on a theorem of Tibor Gallai
di: Dumitru, Bogdan, et al.
Pubblicazione: (2025)

Multi-Agent Decision-Focused Learning via Value-Aware Sequential Communication
di: Amoh, Benjamin, et al.
Pubblicazione: (2026)

Worst-Case Discovery and Runtime Protection for RL-Based Network Controllers
di: Hè, Hongyu, et al.
Pubblicazione: (2026)

A precise condition for independent transversals in bipartite covers
di: Cambie, Stijn, et al.
Pubblicazione: (2023)

Trident: Adaptive Scheduling for Heterogeneous Multimodal Data Pipelines
di: Pan, Ding, et al.
Pubblicazione: (2026)

Greedy and randomized heuristics for optimization of k-domination models in digraphs and road networks
di: Dijkstra, Lukas, et al.
Pubblicazione: (2024)

Three-edge-coloring projective planar cubic graphs: A generalization of the Four Color Theorem
di: Inoue, Yuta, et al.
Pubblicazione: (2024)

LAMMPS-KOKKOS: Performance Portable Molecular Dynamics Across Exascale Architectures
di: Johansson, Anders, et al.
Pubblicazione: (2025)

NBI-Slurm: Simplified submission of Slurm jobs with energy saving mode
di: Telatin, Andrea
Pubblicazione: (2026)

Introducing COGENT3: An AI Architecture for Emergent Cognition
di: Salazar, Eduardo
Pubblicazione: (2025)

Colouring the interference digraph of a set of requests in a bidirected tree
di: Boulier, Hugo, et al.
Pubblicazione: (2026)

On 3-colorability of (claw, diamond)-free graphs
di: Hodur, Nadzieja, et al.
Pubblicazione: (2026)

Adversarial Patch Attacks on Vision-Based Cargo Occupancy Estimation via Differentiable 3D Simulation
di: Hedna, Mohamed Rissal, et al.
Pubblicazione: (2025)

SDVDiag: Using Context-Aware Causality Mining for the Diagnosis of Connected Vehicle Functions
di: Weiß, Matthias, et al.
Pubblicazione: (2026)

Socio-cognitive agent-oriented evolutionary algorithm with trust-based optimization
di: Urbańczyk, Aleksandra, et al.
Pubblicazione: (2025)

Online coloring of short interval graphs and two-count interval graphs
di: Curbelo, Israel R.
Pubblicazione: (2024)

The hard-core model in graph theory
di: Davies, Ewan, et al.
Pubblicazione: (2025)