English(EN) On the Cyclic Assumption of the Cow-Path Search Algorithm

牛路径搜索算法最优性得到严格证明

作者 PulseAugur 编辑部 · [1 个来源] · 2026-10-08 04:00

本文详细证明了为牛路径问题设计的随机算法的最优性。该算法由 Kao、Reif 和 Tate 开发，涉及一头牛以固定的循环顺序访问 $w$ 条路径，以寻找一个距离未知的目标。Kao、Ma、Sipser 和 Yin 此前的工作已经证明了该算法对所有 $w$ 的最优性，并声称没有算法可以超越最佳的循环算法。本文旨在严格证明这一论断。 AI

排序理由该项目是一篇学术论文，详细介绍了算法的证明。[lever_c_demoted from research: ic=1 ai=0.1]

在 arXiv cs.LG 阅读 →

AI 生成摘要 · Google Gemini · 来自 1 个来源。我们如何撰写摘要 →

本文如何被排名

Signal score: 1 / 100; Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket: Tool; 该项目是一篇学术论文，详细介绍了算法的证明。[lever_c_demoted from research: ic=1 ai=0.1]
Source corroboration: Single-source cluster; Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
Topics: paper, other; Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance: Low; Off-topic or adjacent — cluster remains reachable but doesn't surface in AI-industry rankings.
Story freshness: Same-day; Cluster formed today. Ranking reflects the current source set at time of score.

完整方法见我们的编辑标准。

报道来源 [1]

arXiv cs.LG TIER_1 English(EN) · Yuan Ma, Yiqun Lisa Yin · 2026-10-08 04:00

关于牛迹搜索算法的循环假设

arXiv:2610.10253v1 Announce Type: cross Abstract: In the cow-path problem, a cow must find a goal lying at an unknown distance on one of $w$ paths connected only at the origin, and performance is measured by competitive ratio. Kao, Reif and Tate designed an efficient randomized a…

本文如何被排名

报道来源 [1]

关于牛迹搜索算法的循环假设

相关实体

相关话题