Cover Image

Accelerating Probabilistic Response-Time Analysis: Revised Critical Instant and Optimized Convolution

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Takahashi, Hiroto, Yano, Atsushi, Azumi, Takuya
Format:	Preprint
Published:	2025
Subjects:	Operating Systems Data Structures and Algorithms Robotics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Bounded Local Generator Classes for Deterministic State Evolution
by: Martin II, R. Jay
Published: (2026)

Work-in-Progress: Multi-Deadline DAG Scheduling Model for Autonomous Driving Systems
by: Yano, Atsushi, et al.
Published: (2025)

Work in Progress: Middleware-Transparent Callback Enforcement in Commoditized Component-Oriented Real-time Systems
by: Ishikawa-Aso, Takahiro, et al.
Published: (2025)

ipc_shared_ptr: A Publish/Subscribe-Aware Smart Pointer for Cross-Process Object Lifetime Management
by: Ishikawa-Aso, Takahiro, et al.
Published: (2026)

On the Power of Spatial Locality on Online Routing Problems
by: Guragain, Swapnil, et al.
Published: (2025)

On the number of MUSs crossing a position
by: Fujimaru, Hiroto, et al.
Published: (2025)

Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval
by: Geft, Tzvika, et al.
Published: (2025)

Learning-Augmented Online TRP on a Line
by: Guragain, Swapnil, et al.
Published: (2026)

Forming Large Patterns with Local Robots in the OBLOT Model
by: Hahn, Christopher, et al.
Published: (2024)

Leveraging Fixed-Parameter Tractability for Robot Inspection Planning
by: Mizutani, Yosuke, et al.
Published: (2024)

Symmetry Preservation in Swarms of Oblivious Robots with Limited Visibility
by: Gerlach, Raphael, et al.
Published: (2024)

C*: A New Bounding Approach for the Moving-Target Traveling Salesman Problem
by: Philip, Allen George, et al.
Published: (2023)

A Space-Efficient Algebraic Approach to Robotic Motion Planning
by: Bentert, Matthias, et al.
Published: (2024)

Robust Out-of-Order Retrieval for Grid-Based Storage at Maximum Capacity
by: Geft, Tzvika, et al.
Published: (2026)

Line Coverage with Multiple Robots: Algorithms and Experiments
by: Agarwal, Saurav, et al.
Published: (2022)

Structured Gossip: A Partition-Resilient DNS for Internet-Scale Dynamic Networks
by: Sinha, Priyanka, et al.
Published: (2026)

Improved Linear-Time Construction of Minimal Dominating Set via Mobile Agents
by: Chand, Prabhat Kumar, et al.
Published: (2025)

Sublinear-Time Reconfiguration of Programmable Matter with Joint Movements
by: Kumar, Manish, et al.
Published: (2026)

Two Results on LPT: A Near-Linear Time Algorithm and Parcel Delivery using Drones
by: Chandran, L. Sunil, et al.
Published: (2024)

On the sensitivity of CDAWG-grammars
by: Fujimaru, Hiroto, et al.
Published: (2025)

Dispersion is (Almost) Optimal under (A)synchrony
by: Kshemkalyani, Ajay D., et al.
Published: (2025)

Agentic Distributed Computing
by: Kshemkalyani, Ajay D., et al.
Published: (2025)

Optimal Dispersion Under Asynchrony
by: Pattanayak, Debasish, et al.
Published: (2025)

Secure and secret cooperation in robotic swarms
by: Ferrer, Eduardo Castelló, et al.
Published: (2019)

Location-Aware Dispersion on Anonymous Graphs
by: Himani, et al.
Published: (2026)

Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees
by: Mieno, Takuya, et al.
Published: (2024)

On Bounds for Greedy Schemes in String Optimization based on Greedy Curvatures
by: Li, Bowen, et al.
Published: (2024)

Constant sensitivity on the CDAWGs
by: Hamai, Rikuya, et al.
Published: (2025)

Tight bounds for the sensitivity of CDAWGs with left-end edits
by: Fujimaru, Hiroto, et al.
Published: (2023)

Time and Supply Fairness in Electricity Distribution using $k$-times bin packing
by: Baghel, Dinesh Kumar, et al.
Published: (2026)

A Performance Bound for the Greedy Algorithm in a Generalized Class of String Optimization Problems
by: Van Over, Brandon, et al.
Published: (2024)

Computational Complexity Analysis of Interval Methods in Solving Uncertain Nonlinear Systems
by: Prakash, Rudra, et al.
Published: (2026)

Moving Matter: Using a Single, Simple Robot to Reconfigure a Connected Set of Building Blocks
by: Garcia, Javier, et al.
Published: (2025)

A Mixed-Integer Conic Program for the Moving-Target Traveling Salesman Problem based on a Graph of Convex Sets
by: Philip, Allen George, et al.
Published: (2024)

Adapting Dijkstra for Buffers and Unlimited Transfers
by: Katkalo, Denys, et al.
Published: (2026)

On the Exponential Growth of Geometric Shapes
by: Almalki, Nada, et al.
Published: (2023)

Early Pruning for Public Transport Routing
by: Rohovyi, Andrii, et al.
Published: (2026)

Optimizing Line Segment Inspection with Limited-Range Drones
by: Díaz-Báñez, José-Miguel, et al.
Published: (2026)

LatticeHashForest: An Efficient Data Structure for Repetitive Data and Operations
by: Ghorui, Anamitra, et al.
Published: (2025)

Accelerating Spectral Clustering on Quantum and Analog Platforms
by: Xu, Xingzi, et al.
Published: (2024)