Synapse
⌘+K
Synapse
PulseExploreClubsResearchersJournals
Instagram
HomeClubsExplore
July 27, 2026Results in Applied MathematicsOpen Access

Deterministic Ω-search for discrete configuration spaces

View Full Paper
Ask AI
Bookmark
Share

Authors

NRNevena RankovićTilburg UniversityDRDragica RankovićUnion University

Discussion

Loading...

Member takes

Overview

Randomized trial introduces deterministic Ω-search to optimize exploration of discrete configuration spaces, implying efficiency in computational workflows.

Key Points

  • This research aims to improve exploration strategies for discrete configuration spaces by developing a deterministic Ω-search method.
  • Introduced deterministic Ω-search based on orthogonal-array sampling for balanced subset evaluation.
  • Formalized the configuration-search problem and derived response algebra under orthogonal-array sampling.
  • Analyzed standard designs like L9, L12, L16, and L27 for search-budget reduction.
  • Demonstrated balanced experimental design leads to reduced computational effort in evaluating configurations.
  • Provided formal guarantees for unbiasedness of level means and bounded optimality under weak interactions.
  • Establishes a combinatorial link between Latin squares and orthogonal arrays to facilitate design generation.

Cite This Study

Ranković et al. (2026) studied this question.

synapsesocial.com/papers/6a67009540bca442e0d4a54fhttps://doi.org/10.1016/j.rinam.2026.100745
View Full Paper
Ask AI
Bookmark
Share