Sciweavers

11371 search results - page 1937 / 2275
» The network inhibition problem
Sort
View
TKDE
2012
199views Formal Methods» more  TKDE 2012»
13 years 10 months ago
Subscriber Assignment for Wide-Area Content-Based Publish/Subscribe
— We study the problem of assigning subscribers to brokers in a wide-area content-based publish/subscribe system. A good assignment should consider both subscriber interests in t...
Albert Yu, Pankaj K. Agarwal, Jun Yang
DAC
2005
ACM
16 years 8 months ago
Fault and energy-aware communication mapping with guaranteed latency for applications implemented on NoC
As feature sizes shrink, transient failures of on-chip network links become a critical problem. At the same time, many applications require guarantees on both message arrival prob...
Sorin Manolache, Petru Eles, Zebo Peng
ICML
1999
IEEE
16 years 8 months ago
Distributed Value Functions
Many interesting problems, such as power grids, network switches, and tra c ow, that are candidates for solving with reinforcement learningRL, alsohave properties that make distri...
Jeff G. Schneider, Weng-Keen Wong, Andrew W. Moore...
WWW
2008
ACM
16 years 8 months ago
Tag-based social interest discovery
The success and popularity of social network systems, such as del.icio.us, Facebook, MySpace, and YouTube, have generated many interesting and challenging problems to the research...
Xin Li, Lei Guo, Yihong Eric Zhao
PODC
2009
ACM
16 years 8 months ago
Brief announcement: global consistency can be easier than point-to-point communication
Global consistency or Byzantine Agreement (BA) and reliable point-to-point communication are two of the most important and well-studied problems in distributed computing. Informal...
Prasant Gopal, Anuj Gupta, Pranav K. Vasishta, Piy...
« Prev « First page 1937 / 2275 Last » Next »