524 search results - page 67 / 105 » An Optimal Lower Bound on the Communication Complexity of Ga... |
SPAA
2003
ACM
14 years 1 months ago
2003
ACM
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
PODC
2004
ACM
14 years 1 months ago
2004
ACM
Abstract With n servers that independently fail with probability of p < 0.5, it is well known that the majority quorum system achieves the best availability among all quorum sys...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
This paper describes and analyzes sporadic model building, which can be used to enhance the efficiency of the hierarchical Bayesian optimization algorithm (hBOA) and other advance...
SIROCCO
2010
13 years 6 months ago
2010
We consider the problem of exploring an anonymous unoriented ring of size n by k identical, oblivious, asynchronous mobile robots, that are unable to communicate, yet have the abil...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
—In this paper, the joint source and channel coding for progressive image transmission over channels with varying SNR is considered. Since the feedback of channel status informat...