We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pev...
Filtering denotes any method whereby an agent updates its belief state--its knowledge of the state of the world--from a sequence of actions and observations. In logical filtering,...
The minimum singular value (MSV) rule is a useful tool for selecting controlled variables (CVs) from the available measurements. However, the application of the MSV rule to large-...