2 citations · 4 across the 6 of their papers we have counts for
6 papers
Critical Thresholds for Maximum Cardinality Matching on General Hypergraphs
Christopher Sumnicht, Jamison W. Weber, Dhanush R. Giriyan +1
Significant work has been done on computing the ``average'' optimal solution value for various -complete problems using the Erdös-Rényi model to establish \emph{critic…
An Approximate Dynamic Programming Framework for Occlusion-Robust Multi-Object Tracking
Pratyusha Musunuru, Yuchao Li, Jamison Weber +1
In this work, we consider data association problems involving multi-object tracking (MOT). In particular, we address the challenges arising from object occlusions. We propose a fra…
Energy-Constrained Programmable Matter Under Unfair Adversaries
Jamison W. Weber, Tishya Chhabra, Andréa W. Richa +1
Individual modules of programmable matter participate in their system's collective behavior by expending energy to perform actions. However, not all modules may have access to the…
Distributed Online Rollout for Multivehicle Routing in Unmapped Environments
Jamison W. Weber, Dhanush R. Giriyan, Devendra R. Parkar +2
In this work we consider a generalization of the well-known multivehicle routing problem: given a network, a set of agents occupying a subset of its nodes, and a set of tasks, we s…
Bio-Inspired Energy Distribution for Programmable Matter
Joshua J. Daymude, Andréa W. Richa, Jamison W. Weber
In systems of active programmable matter, individual modules require a constant supply of energy to participate in the system's collective behavior. These systems are often powered…
Improved Throughput for All-or-Nothing Multicommodity Flows with Arbitrary Demands
Anya Chaturvedi, Chandra Chekuri, Mengxue Liu +4
Throughput is a main performance objective in communication networks. This paper considers a fundamental maximum throughput routing problem -- the all-or-nothing multicommodity flo…