32 citations · 56 across the 5 of their papers we have counts for
6 papers
Testing fine-grained parallelism for the ADMM on a factor-graph
Ning Hao, AmirReza Oghbaee, Mohammad Rostami +2
There is an ongoing effort to develop tools that apply distributed computational resources to tackle large problems or reduce the time to solve them. In this context, the Alternati…
The Boundary Forest Algorithm for Online Supervised and Unsupervised Learning
Charles Mathy, Nate Derbinsky, José Bento +2
We describe a new instance-based learning algorithm called the Boundary Forest (BF) algorithm, that can be used for supervised and unsupervised learning. The algorithm builds a for…
Proximal operators for multi-agent path planning
José Bento, Nate Derbinsky, Charles Mathy +1
We address the problem of planning collision-free paths for multiple agents using optimization methods known as proximal algorithms. Recently this approach was explored in Bento et…
A message-passing algorithm for multi-agent trajectory planning
Jose Bento, Nate Derbinsky, Javier Alonso-Mora +1
We describe a novel approach for computing collision-free \emph{global} trajectories for agents with specified initial and final configurations, based on an improved version of…
Methods for Integrating Knowledge with the Three-Weight Optimization Algorithm for Hybrid Cognitive Processing
Nate Derbinsky, José Bento, Jonathan S. Yedidia
In this paper we consider optimization as an approach for quickly and flexibly developing hybrid cognitive capabilities that are efficient, scalable, and can exploit knowledge to i…
An Improved Three-Weight Message-Passing Algorithm
Nate Derbinsky, José Bento, Veit Elser +1
We describe how the powerful "Divide and Concur" algorithm for constraint satisfaction can be derived as a special case of a message-passing version of the Alternating Direction Me…