Sciweavers

1989 search results - page 368 / 398
» cost 2010
Sort
View
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 9 months ago
Where are the hard manipulation problems?
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
Toby Walsh
CORR
2010
Springer
190views Education» more  CORR 2010»
13 years 9 months ago
Stable marriage problems with quantitative preferences
The stable marriage problem is a well-known problem of matching men to women so that no man and woman, who are not married to each other, both prefer each other. Such a problem ha...
Maria Silvia Pini, Francesca Rossi, Kristen Brent ...
CORR
2010
Springer
185views Education» more  CORR 2010»
13 years 9 months ago
Acdmcp: An adaptive and completely distributed multi-hop clustering protocol for wireless sensor networks
Clustering is a very popular network structuring technique which mainly addresses the issue of scalability in large scale Wireless Sensor Networks. Additionally, it has been shown...
Khalid Nawaz, Alejandro P. Buchmann
CORR
2010
Springer
165views Education» more  CORR 2010»
13 years 9 months ago
Coalition Formation Games for Distributed Cooperation Among Roadside Units in Vehicular Networks
Vehicle-to-roadside (V2R) communications enable vehicular networks to support a wide range of applications for enhancing the efficiency of road transportation. While existing work...
Walid Saad, Zhu Han, Are Hjørungnes, Dusit ...
CORR
2010
Springer
189views Education» more  CORR 2010»
13 years 9 months ago
Coalition Formation Games for Collaborative Spectrum Sensing
Abstract--Collaborative Spectrum Sensing (CSS) between secondary users (SUs) in cognitive networks exhibits an inherent tradeoff between minimizing the probability of missing the d...
Walid Saad, Zhu Han, Tamer Basar, Mérouane ...