2084 search results - page 415 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
COMCOM
2010
13 years 6 months ago
2010
—In this paper, we study the trade-off between network throughput and fairness in a multi-channel enabled WSN. Traditional approaches attempt to solve the two problems in an isol...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
EUROCAST
2007
Springer
14 years 1 months ago
2007
Springer
Abstract a paradigm of modern Machine Learning (ML) which uses rewards and punishments to guide the learning process. One of the central ideas of RL is learning by “direct-online...
EPS
1998
Springer
13 years 11 months ago
1998
Springer
We investigate the following question. Do populations of evolving agents adapt only to their recent environment or do general adaptive features appear over time? We find statistica...
CN
2010
13 years 7 months ago
2010
The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as little sensor nodes as possible. One way ...