We study the information complexity in the randomized setting of solving a general elliptic PDE of order 2m in a smooth, bounded domain Q Rd with smooth coefficients and homogene...
Abstract-- This paper introduces a generalization of the Gravitational Clustering Algorithm proposed by Gomez et all in [1]. First, it is extended in such a way that not only the G...
The most common reason for plan repair are the violation of a plan’s temporal constraints. Air Traffic Control is an example of an area in which violations of the plan’s tempo...
—The language game approach is widely adopted to study conventionalization of linguistic knowledge. Most of contemporary models concentrate on the dynamics of language games in r...
Tao Gong, Andrea Puglisi, Vittorio Loreto, William...
In constrained clustering it is common to model the pairwise constraints as edges on the graph of observations. Using results from graph theory, we analyze such constraint graphs ...