相关论文: Ordered Front-to-back Any-Hit Traversal in RTX

We introduce a natural generalization of the forward-starting options, first discussed by M. Rubinstein. The main feature of the contract presented here is that the strike-determination time is not fixed ex-ante, but allowed to be random,…

The problem Orienteering asks whether there exists a walk which visits a number of sites without exceeding some fuel budget. In the variant of the problem we consider, the cost of each edge in the walk is dependent on the time we depart one…

Multipath TCP (MPTCP) is a transport layer protocol that allows network devices to transfer data over multiple concurrent paths, and hence, utilizes the network resources more effectively than does the traditional single-path TCP. However,…

An innovative method based on the traversal of rays, originating from detected particles, through a three-dimensional grid of voxels is presented. The methodology has as main advantage that the outcome of the method is independent of the…

We address the problem of optimizing the performance of a dynamic system while satisfying hard safety constraints at all times. Implementing an optimal control solution is limited by the computational cost required to derive it in real…

The paper focuses on two problems: (i) how to orient the edges of an undirected graph in order to maximize the number of ordered vertex pairs (x,y) such that there is a directed path from x to y, and (ii) how to orient the edges so as to…

This paper studies the optimality and complexity of Follow-the-Perturbed-Leader (FTPL) policy in size-invariant combinatorial semi-bandit problems. Recently, Honda et al. (2023) and Lee et al. (2024) showed that FTPL achieves…

This chapter studies the problem of traversing large graphs using the breadth-first search order on distributed-memory supercomputers. We consider both the traditional level-synchronous top-down algorithm as well as the recently discovered…

Iterative methods for tomographic image reconstruction have great potential for enabling high quality imaging from low-dose projection data. The computational burden of iterative reconstruction algorithms, however, has been an impediment in…

In this paper, we solve unbalanced optimal transport (UOT) problem on surfaces represented by point clouds. Based on alternating direction method of multipliers algorithm, the original UOT problem can be solved by an iteration consists of…

We develop optimal control strategies for autonomous vehicles (AVs) that are required to meet complex specifications imposed as rules of the road (ROTR) and locally specific cultural expectations of reasonable driving behavior. We formulate…

Objects moving at high speed along complex trajectories often appear in videos, especially videos of sports. Such objects elapse non-negligible distance during exposure time of a single frame and therefore their position in the frame is not…

Due to network practices such as traffic engineering and multi-homing, the number of routes---also known as IP prefixes---in the global forwarding tables has been increasing significantly in the last decade and continues growing in a super…

We study the problem of maintaining a breadth-first spanning tree and the induced BFS ordering in a directed graph under edge updates. While semi-dynamic algorithms are known, maintaining the spanning tree, level information, and numbering…

In this paper, we develop a framework for the automatic taxiing of aircraft between hangar and take-off given a graph-based model of an airport. We implement a high-level path-planning algorithm that models taxiway intersections as nodes in…

Consider an input consisting of a set of $n$ disjoint triangular obstacles in $\mathbb{R}^3$ and a target point $t$ in the free space, all enclosed by a large sphere $S$ of radius $R$ centered at $t$. An articulated probe is modeled as two…

Modern transportation network modeling increasingly involves the integration of diverse methodologies including sensor-based forecasting, reinforcement learning, classical flow optimization, and demand modeling that have traditionally been…

In this short note, we show that cutting cycles of rods is fixed-parameter tractable by reducing the problem to computing a feedback vertex set in a mixed graph.

We construct an effective field theory (EFT) that captures the universal behavior of out-of-time-order correlators (OTOCs) at late times in generic quantum many-body systems with conservation laws. The EFT hinges on a generalization of the…

This document presents the full implementation details of BT-trees, a highly efficient ordered map, and an evaluation which compares BT-trees with unordered maps. BT- trees are often much faster than other ordered maps, and have comparable…