We consider the problem of controlling a continuous-time linear stochastic system from a specification given as a Linear Temporal Logic (LTL) formula over a set of linear predicate...
Morteza Lahijanian, Sean B. Andersson, Calin Belta
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submo...
In past work, the Metropolis Algorithm along with Gibbs Priors was used to successfully segment two-dimensional noisy gray images into a small finite number of labels. In applicat...
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
A large number of problems that occur in knowledge-representation, learning, VLSI-design, and other areas of artificial intelligence, are essentially satisfiability problems. The ...