Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
—The efficient application of graph cuts to Markov Random Fields (MRFs) with multiple discrete or continuous labels remains an open question. In this paper, we demonstrate one p...
Victor S. Lempitsky, Carsten Rother, Stefan Roth, ...
In this paper, we develop new methods for the analysis of decentralized control systems and we apply them to formation control problems. The basic set-up consists of a system with...
Background: Multiple sequence alignment algorithms are very important tools in molecular biology today. Accurate alignment of proteins is central to several areas such as homology...
Saikat Chakrabarti, Nitin Bhardwaj, Prem A. Anand,...
Abstract. While a variety of multiple classifier systems have been studied since at least the late 1950's, this area came alive in the 90's with significant theoretical a...