跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+197新增论文
+151其中 AI 相关
+16已有论文修订
+91新增 AI 导读

arXiv 最近完成扫描:2026-11-22 06:41 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

统计 2026-11-21 08:29 — 2026-11-22 08:29(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-22 06:41最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-22 06:39(北京时间)
新论文 · v1arXiv:2611.20146

Evacuating from Eventually Emerging Targets on the Line

Konstantinos Georgiou, Caleb Jones, Liza Krupsky

原文摘要

We introduce and study Eventually Emerging Linear Search, an online evacuation problem on the line that, to the best of our knowledge, has not been studied before. In this problem, $n$ unit-speed agents with wireless communication start at the origin and search for a hidden target at location $x$, where $|x|\geq1$, that becomes detectable at an unknown time $T$. Visiting $x$ before time $T$ reveals nothing, and the search terminates only when all agents have reached the target. We study two competitive measures. In the emergence-aware model, the target location becomes known to the offline algorithm at time $T$, giving cost $T+|x|$. In the fully-informed model, the offline algorithm knows $x$ from the beginning, giving cost $\max\{|x|,T\}$. For one agent, the optimal competitive ratio is $9$ under both measures, as in classical cow-path search. For two agents, we give an algorithm with competitive ratio $3+\sqrt6$ under both measures, and prove it optimal within the class of origin-separated algorithms, in which each agent performs strictly expanding origin-return excursions on a fixed half-line. We also prove the unconditional lower bounds $4.35$ and $4.38$ for the emergence-aware and fully-informed measures, respectively. These bounds are computer-assisted; we derive finite linear programming relaxations for arbitrary algorithms and certify their infeasibility using exact rational Farkas certificates. For three agents, we prove analytically the unconditional lower bounds $3.1014$ and $3.2823$ for the emergence-aware and fully-informed measures, respectively, and introduce a geometric three-peak family. Different parameter choices give the corresponding upper bounds $4.010599$ and $4.340445$. These bounds lie below the corresponding two-agent lower bounds, so a third agent provably improves both measures.

cs.DM