Sciweavers

835 search results - page 18 / 167
» Characterizing rosy theories
Sort
View
CORR
2007
Springer
117views Education» more  CORR 2007»
14 years 11 months ago
A Geometric Interpretation of Fading in Wireless Networks: Theory and Applications
Abstract—In wireless networks with random node distribution, the underlying point process model and the channel fading process are usually considered separately. A unified frame...
Martin Haenggi
FOSSACS
2011
Springer
14 years 3 months ago
Ordinal Theory for Expressiveness of Well Structured Transition Systems
To the best of our knowledge, we characterize for the first time the importance of resources (counters, channels, alphabets) when measuring expressiveness of WSTS. We establish, f...
Rémi Bonnet, Alain Finkel, Serge Haddad, Fe...
LICS
1998
IEEE
15 years 4 months ago
On Proofs about Threshold Circuits and Counting Hierarchies
Hierarchies (Extended Abstract) Jan Johannsen Chris Pollett Department of Mathematics Department of Computer Science University of California, San Diego Boston University La Jolla,...
Jan Johannsen, Chris Pollett
CORR
2004
Springer
119views Education» more  CORR 2004»
14 years 11 months ago
Exploring networks with traceroute-like probes: theory and simulations
Mapping the Internet generally consists in sampling the network from a limited set of sources by using traceroute-like probes. This methodology, akin to the merging of different s...
Luca Dall'Asta, J. Ignacio Alvarez-Hamelin, Alain ...
ATAL
2009
Springer
15 years 6 months ago
Characterizing false-name-proof allocation rules in combinatorial auctions
A combinatorial auction mechanism consists of an allocation rule that defines the allocation of goods for each agent, and a payment rule that defines the payment of each winner....
Taiki Todo, Atsushi Iwasaki, Makoto Yokoo, Yuko Sa...