3820 search results - page 709 / 764 » Bounded Model Debugging |
129
click to vote
SIGECOM
2005
ACM
15 years 7 months ago
2005
ACM
We study first-price auction mechanisms for auctioning flow between given nodes in a graph. A first-price auction is any auction in which links on winning paths are paid their ...
119
click to vote
WS
2005
ACM
15 years 7 months ago
2005
ACM
The pervasiveness of wireless devices and the architectural organization of wireless networks in distributed communities, where no notion of trust can be assumed, are the main rea...
120
click to vote
CRYPTO
2005
Springer
15 years 7 months ago
2005
Springer
We study the question whether the sequential or parallel composition of two functions, each indistinguishable from a random function by non-adaptive distinguishers is secure agains...
116
click to vote
WINE
2005
Springer
15 years 7 months ago
2005
Springer
We propose a simple and intuitive cost mechanism which assigns costs for the competitive usage of m resources by n selfish agents. Each agent has an individual demand; demands are...
115
click to vote
WINE
2005
Springer
15 years 7 months ago
2005
Springer
We study a model of path-vector routing in which nodes’ routing policies are based on subjective cost assessments of alternative routes. The routes are constrained by the requir...