Unverified50% confidenceFactExact time
Two-stack sliding window aggregation is a stream computing algorithm that uses two stacks to maintain a sliding window, completing element insertion and expiry deletion in O(1) amortised time, and querying the aggregate value within the window in real time.
1
Sources
50%
Confidence
Long-term
Relevance
10/16/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedIn two-stack sliding window aggregation, each element is moved from the back stack to the front stack only once in its lifetime, so the total cost of any sequence of consecutive operations is proportional to the number of elements, with each insertion/deletion/query being O(1) amortized.74% similarUnverifiedThe sliding time window is a commonly used rate-limiting algorithm in distributed systems, implemented by maintaining a timestamp queue or circular buffer, and can avoid the boundary spike problem of fixed windows.66% similarUnverifiedContinual Harness采用双循环架构：内循环为普通智能体交互步骤，外循环为Harness优化，由Refiner定期读取轨迹窗口识别失败模式并生成编辑操作59% similarUnverified多智能体并行架构本质上是将链式推理拆解为有向无环图（DAG）式任务调度，可将整体完成时间从O(n)降至接近O(max_subtask)59% similarUnverified并行工具调用（Parallel Tool Calling）可将单轮循环延迟从串行的数秒压缩至并行的毫秒级58% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1043390API
curl https://kongchang.com/api/v1/knowledge/claims/1043390MCP
get_claim(id=1043390)