Proposes a path-finding algorithm with A* as an alternative to Edmonds' blossom algorithm for computing minimal-weight-matching centrosymmetry parameter.
Robust benchmarking in noisy environments
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We propose a benchmarking strategy that is robust in the presence of timer error, OS jitter and other environmental fluctuations, and is insensitive to the highly nonideal statistics produced by timing measurements. We construct a model that explains how these strongly nonideal statistics can arise from environmental fluctuations, and also justifies our proposed strategy. We implement this strategy in the BenchmarkTools Julia package, where it is used in production continuous integration (CI) pipelines for developing the Julia language and its ecosystem.
fields
physics.comp-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A path-finding algorithm for computing minimal-weight-matching centrosymmetry parameter
Proposes a path-finding algorithm with A* as an alternative to Edmonds' blossom algorithm for computing minimal-weight-matching centrosymmetry parameter.