Intelligent coordination in complex multi-agent environments requires sophisticated mechanisms for suboptimal task decomposition and efficient resource allocation provided by the t...
Planning is known to be a difficult task. One of the approaches used to reduce this difficulty is problem decomposition under divide-and-conquer methodology. This paper introduce...
We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a c...
Minimum mean squared error estimates generally are not optimal in terms of a common track error statistic used in tracking benchmarks, namely a form of the Mean Optimal Subpattern...
David Frederic Crouse, Peter Willett, Yaakov Bar-S...
Abstract. We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP), whose performances are independent of the number k of c...