We present algorithms for exactly learning unknown environments that can be described by deterministic nite automata. The learner performs a walk on the target automaton, where at...
For a social robot, the ability of learning tasks via human demonstration is very crucial. But most current approaches suffer from either the demanding of the huge amount of label...
Zhe Li, Sven Wachsmuth, Jannik Fritsch, Gerhard Sa...
One of the open problems listed in Rivest and Schapire, 1989] is whether and how that the copies of L in their algorithm can be combined into one for better performance. This pape...
In this paper we propose a Gaussian-kernel-based online kernel density estimation which can be used for applications of online probability density estimation and online learning. ...
Majority of the existing approaches to service composition, including the widely popular planning based techniques, are not able to automatically compose practical workflows that ...