1 citations · 1 across the 2 of their papers we have counts for
4 papers · 1 filter
Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound
Romain Cosson, Laurent Massoulié
We study the problem of collective tree exploration in which a team of mobile agents must collectively visit all nodes of an unknown tree in as few moves as possible. The agent…
Collective Tree Exploration via Potential Function Method
Romain Cosson, Laurent Massoulié
We study the problem of collective tree exploration (CTE) where a team of agents is tasked to traverse all the edges of an unknown tree as fast as possible, assuming complete c…
Breaking the k/log k Barrier in Collective Tree Exploration via Tree-Mining
Romain Cosson
In collective tree exploration, a team of mobile agents is tasked to go through all edges of an unknown tree as fast as possible. An edge of the tree is revealed to the team wh…
Quantifying Variational Approximation for the Log-Partition Function
Romain Cosson, Devavrat Shah
Variational approximation, such as mean-field (MF) and tree-reweighted (TRW), provide a computationally efficient approximation of the log-partition function for a generic graphica…