Given a graph G, a k-dominating set of G is a subset S of its vertices with the property that every vertex of G is either in S or has at least k neighbors in S. We present a new i...
Mathieu Couture, Michel Barbeau, Prosenjit Bose, E...
In this paper, we present the design of foundation PKI (fPKI), a PKI system constructed on an overlay network for an open source community. fPKI can provide an alternative PKI sys...
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
This article presents a new system for automatically constructing and training radial basis function networks based on original evolutionary computing methods. This system, called...