The dynamics of the learning equation, which describes the evolution of the synaptic weights, is derived in the situation where the network contains recurrent connections. The deri...
Anthony N. Burkitt, Matthieu Gilson, J. Leo van He...
Directed hypergraphs are used to model networks whose nodes are connected by directed buses. We study in this paper two parameters related to the fault-tolerance of directed bus n...
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...
The generalized LR parsing algorithm for context-free grammars is extended for the case of Boolean grammars, which are a generalization of the context-free grammars with logical c...
In [1, 2] we studied various concepts of bipolar queries (cf. Dubois and Prade [3]). We advocated there the use of a fuzzified version of the original crisp definition introduced...