9949 search results - page 403 / 1990 » On the Network Complexity of Selection |
198
click to vote
IPSN
2005
Springer
16 years 1 months ago
2005
Springer
We consider coverage problems in sensor networks of stationary nodes with minimal geometric data. In particular, there are no coordinates and no localization of nodes. We introduc...
183
click to vote
SIMUTOOLS
2008
15 years 9 months ago
2008
This paper presents an OMNeT-based Framework to simulate large complex storage networks, with its corresponding underlying subsystems (I/O, Networking, etc.). With this Framework,...
224
click to vote
AUSDM
2008
Springer
15 years 9 months ago
2008
Springer
LBR is a highly accurate classification algorithm, which lazily constructs a single Bayesian rule for each test instance at classification time. However, its computational complex...
167
click to vote
ICANN
2005
Springer
16 years 1 months ago
2005
Springer
This paper presents a method that combines Mutual Information and k-Nearest Neighbors approximator for time series prediction. Mutual Information is used for input selection. K-Nea...
225
click to vote
IWQOS
2004
Springer
16 years 1 months ago
2004
Springer
— We propose a rank-based peer-selection mechanism for peer-to-peer media streaming systems. The mechanism provides incentives for cooperation through service differentiation. Co...