1258 search results - page 167 / 252 » Table design in dynamic programming |
109
Voted
DASFAA
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract. As networks continue to grow in size and complexity, distributed network monitoring and resource querying are becoming increasingly difficult. Our aim is to design, build...
109
Voted
NSDI
2004
15 years 4 months ago
2004
Most current peer-to-peer lookup schemes keep a small amount of routing state per node, typically logarithmic in the number of overlay nodes. This design assumes that routing info...
133
Voted
USITS
2003
15 years 4 months ago
2003
In this paper, we argue that a broad range of large-scale network services would benefit from a scalable mechanism for delivering state about a random subset of global participan...
120
click to vote
CN
2008
15 years 3 months ago
2008
As more applications rely on underlying peer-to-peer topologies, the need for efficient and resilient infrastructure has become more pressing. A number of important classes of top...
229
Voted
SIGMOD
2008
ACM
16 years 3 months ago
2008
ACM
To deal with data uncertainty, existing probabilistic database systems augment tuples with attribute-level or tuple-level probability values, which are loaded into the database al...