Sciweavers

963 search results - page 160 / 193
» Escape Analysis on Lists
Sort
View
PODC
2006
ACM
15 years 6 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
91
Voted
SIGCOMM
2006
ACM
15 years 6 months ago
Minimizing churn in distributed systems
A pervasive requirement of distributed systems is to deal with churn — change in the set of participating nodes due to joins, graceful leaves, and failures. A high churn rate ca...
Brighten Godfrey, Scott Shenker, Ion Stoica
SIGCSE
2006
ACM
362views Education» more  SIGCSE 2006»
15 years 6 months ago
Chirp on crickets: teaching compilers using an embedded robot controller
Traditionally, the topics of compiler construction and language processing have been taught as an elective course in Computer Science curricula. As such, students may graduate wit...
Li Xu, Fred G. Martin
96
Voted
SIGECOM
2006
ACM
142views ECommerce» more  SIGECOM 2006»
15 years 6 months ago
Computing the optimal strategy to commit to
In multiagent systems, strategic settings are often analyzed under the assumption that the players choose their strategies simultaneously. However, this model is not always realis...
Vincent Conitzer, Tuomas Sandholm
130
Voted
AINA
2005
IEEE
15 years 6 months ago
iHITS: Extending HITS for Personal Interests Profiling
Ever since the boom of World Wide Web, profiling online users' interests has become an important task for content providers. The traditional approach involves manual entry of...
Ziming Zhuang