1274 search results - page 237 / 255 » Graph lambda theories |
SIGCOMM
2004
ACM
14 years 1 months ago
2004
ACM
A detailed understanding of the many facets of the Internet’s topological structure is critical for evaluating the performance of networking protocols, for assessing the effecti...
IPSN
2004
Springer
14 years 29 days ago
2004
Springer
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
SPAA
2003
ACM
14 years 25 days 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...
COCO
1994
Springer
13 years 11 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
AAAI
2006
13 years 9 months ago
2006
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...