Sciweavers

503 search results - page 82 / 101
» Verifying Quantitative Properties Using Bound Functions
Sort
View
SIGECOM
2008
ACM
127views ECommerce» more  SIGECOM 2008»
14 years 9 months ago
Posted prices vs. negotiations: an asymptotic analysis
Full revelation of private values is impractical in many large-scale markets, where posted price mechanisms are a simpler alternative. In this work, we compare the asymptotic beha...
Liad Blumrosen, Thomas Holenstein
FOSSACS
2008
Springer
14 years 11 months ago
Erasure and Polymorphism in Pure Type Systems
We introduce Erasure Pure Type Systems, an extension to Pure Type Systems with an erasure semantics centered around a type constructor indicating parametric polymorphism. The eras...
Nathan Mishra-Linger, Tim Sheard
CAINE
2008
14 years 11 months ago
New Architecture and Protocols for Global-Scale Machine Communities
This article is about the new universal architecture which allows electronic devices of different functionalities and manufacturers, as well as on-line services, to seamlessly int...
Vladimir Krylov, N. Mikhaylov, Dmitry V. Ponomarev
CORR
2007
Springer
126views Education» more  CORR 2007»
14 years 9 months ago
Interference and Outage in Clustered Wireless Ad Hoc Networks
—In the analysis of large random wireless networks, the underlying node distribution is almost ubiquitously assumed to be the homogeneous Poisson point process. In this paper, th...
Radha Krishna Ganti, Martin Haenggi
DM
2007
83views more  DM 2007»
14 years 9 months ago
Codes identifying sets of vertices in random networks
In this paper we deal with codes identifying sets of vertices in random networks; that is, (1, ≤ ℓ)-identifying codes. These codes enable us to detect sets of faulty processor...
Alan M. Frieze, Ryan Martin, Julien Moncel, Mikl&o...