Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
We present a rst randomized Ologk n time and On+m work CRCWPRAM algorithm for nding a spanning forest of an undirected dense graph with n vertices. Furthermore we construct a rando...
Anders Dessmark, Carsten Dorgerloh, Andrzej Lingas...
In this paper, we propose an approximation of the relative phase probability function (RP pdf) and use it to find a non-iterative estimator for the concentration parameter of the...
The paper addresses the convergence of a decentralized Robbins-Monro algorithm for networks of agents. This algorithm combines local stochastic approximation steps for finding th...