An n-node tree has to be explored by a group of k mobile robots deployed initially at the root. Robots traverse the edges of the tree until all nodes are visited. We would like to ...
Miroslaw Dynia, Miroslaw Korzeniowski, Christian S...
We consider a parsed text corpus as an instance of a labelled directed graph, where nodes represent words and weighted directed edges represent the syntactic relations between the...
The paper proposes an approach to information retrieval based on the use of a structure (ontology) both for document (resp. query) indexing and query evaluating. The conceptual st...
We develop necessary and sufficient conditions for quadratic stabilizability of linear networked control systems by dynamic output feedback and communication protocols. These cond...
Abstract— This paper presents i-AA1 , a constructive, incremental learning algorithm for a special class of weightless, self-organizing networks. In i-AA1 , learning consists of ...