3047 search results - page 304 / 610 » Randomized Parallel Selection |
105
click to vote
NN
1998
Springer
15 years 2 months ago
1998
Springer
The number of required hidden units is statistically estimated for feedforward neural networks that are constructed by adding hidden units one by one. The output error decreases w...
120
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
106
click to vote
MST
2010
15 years 28 days ago
2010
We study here the effect of concurrent greedy moves of players in atomic congestion games where n selfish agents (players) wish to select a resource each (out of m resources) so ...
118
Voted
PVLDB
2010
15 years 28 days ago
2010
Uncertain data streams are increasingly common in real-world deployments and monitoring applications require the evaluation of complex queries on such streams. In this paper, we c...
115
Voted
ATAL
2009
Springer
15 years 10 days ago
2009
Springer
This paper is motivated by some recent, intriguing research results involving agent-organized networks (AONs). In AONs, nodes represent agents, and collaboration between nodes are...