1620 search results - page 294 / 324 » eg 2010 |
81
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
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...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Event-driven automation of reactive functionalities for complex event processing is an urgent need in today's distributed service-oriented architectures and Web-based event-d...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Integrating volatile renewable energy resources into the bulk power grid is challenging, due to the reliability requirement that at each instant the load and generation in the syst...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Borrowing from concepts in expander graphs, we study the expansion properties of real-world, complex networks (e.g. social networks, unstructured peer-to-peer or P2P networks) and...
112
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Abstract--Collaborative Spectrum Sensing (CSS) between secondary users (SUs) in cognitive networks exhibits an inherent tradeoff between minimizing the probability of missing the d...