We formulate end-to-end congestion control as a global optimization problem. Based on this formulation, a class of minimum cost flow control (MCFC) algorithms for adjusting sessio...
Auction methods have been successfully used for coordinating teams of robots in the multi-robot routing problem, a representative domain for multi-agent coordination. Solutions to...
Data collections often have inconsistencies that arise due to a variety of reasons, and it is desirable to be able to identify and resolve them efficiently. Set similarity queries ...
Marios Hadjieleftheriou, Amit Chandel, Nick Koudas...
Abstract. Many agent coordination problems can be modeled as distributed constraint optimization problems (DCOPs). ADOPT is an asynchronous and distributed search algorithm that is...
Efficient algorithms to discover frequent patterns are crucial in data mining research. Several effective data structures, such as two-dimensional arrays, graphs, trees, and tries ...