20 results for “Graph-verifiable mobility decisions”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
The authors present a benchmark and evaluation harness for graph-verifiable mobility decisions on self-rendered OpenStreetMap panels.
This paper presents an optimized algorithm for computing cut sets of a path set in graph theory and introduces a vectorized computational framework for property calculations.
The paper introduces an extension of muTGL logic with a new operator called the space horizon to improve expressiveness for analyzing reachability and communication chains in multi-agent systems.
This paper proposes a mechanical auditing approach for verifying AI functions in wireless networks using machine-verifiable specifications.
The paper introduces a diffusion-based uncertainty model for robust optimization on graphs, showing that the resulting computational complexity depends critically on the interaction between the uncert…
This paper introduces the $k$-Step-Central Shortest Path problem to maximize reachability in transportation networks and provides a polynomial-time algorithm for unweighted graphs.
Tatsuya Mitomi, Yahya Gamal, Esra Suel, Gary Polhill +2 more
The paper proposes a framework for generating realistic individual level daily activity schedules that preserve travel times consistent with those reported in travel surveys.
This paper presents VERA-TN, a verification-guided framework that uses a large language model to automate algorithm design for network intent.
This paper introduces Path Consistency Scoring (PCS), a framework that evaluates router geolocation as a path-level consistency problem and produces a path consistency score based on a Hidden Markov M…
This paper introduces online assignment policies for stochastic matching on hypergraphs, which are maximally stable and allow for the derivation of necessary and sufficient stability criteria.
The paper proves XNLP-hardness of Directed Edge Geography and Undirected Edge Geography when parameterized by pathwidth, and shows their fixed-parameter tractability when parameterized by treewidth an…
This paper improves the approximation algorithm for the prize-collecting stroll problem.
A hybrid method for computing constrained branching trajectory modes for moving objects in real-world settings using answer set programming.
Yuting Xu, Jiayi Tian, Jian Liang, Xin Xiong +3 more
The paper introduces VeriTrip, a new verifiable benchmark that evaluates travel planning agents' ability to perform evidence-grounded reasoning over complex, unstructured, and multimodal web data, rev…
The paper introduces a validation framework to evaluate the realism of LLM-based generative agents in urban simulators against real-world mobility data.
Shibo Zhu, Xiaodan Shi, Dayin Chen, Yuntian Chen +3 more
The paper introduces CityTrajBench, a unified benchmark framework that standardizes the evaluation of city-scale vehicle trajectory generation, demonstrating that no single generation model dominates…