We build on recent advances in the design of self-organizing interaction networks by introducing a sexual variant of an existing asexual, mutation-limited algorithm. Both the asexu...
The problem of finding a symmetric connectivity topology with minimum power consumption in a wireless ad-hoc network is NPhard. This work presents a new iterated local search to s...
— In this work, a probabilistic model is established for recurrent networks. The EM (expectation-maximization) algorithm is then applied to derive a new fast training algorithm f...
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...