2084 search results - page 316 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
COLT
2008
Springer
14 years 11 months ago
2008
Springer
We show how models for prediction with expert advice can be defined concisely and clearly using hidden Markov models (HMMs); standard HMM algorithms can then be used to efficientl...
IPPS
2003
IEEE
15 years 3 months ago
2003
IEEE
Given a set of service requests, each char acterize d by a temporal interval and a category, an integer k, and an integer hc for each categoryc, the Server A llocation with Bounde...
119
click to vote
WWW
2011
ACM
14 years 4 months ago
2011
ACM
Modern search engines are expected to make documents searchable shortly after they appear on the ever changing Web. To satisfy this requirement, the Web is frequently crawled. Due...
SIGECOM
2006
ACM
15 years 3 months ago
2006
ACM
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
ATAL
2007
Springer
15 years 4 months ago
2007
Springer
This paper presents a two-sided economic search model in which agents are searching for beneficial pairwise partnerships. In each search stage, each of the agents is randomly mat...