67 search results - page 10 / 14 » A Computational Study of the Kemeny Rule for Preference Aggr... |
MOBICOM
2006
ACM
14 years 1 months ago
2006
ACM
We study the problem of information brokerage in sensor networks, where information consumers (sinks, users) search for data acquired by information producers (sources). Innetwork...
ASSETS
2008
ACM
13 years 8 months ago
2008
ACM
Recent advances in touch screen technology have increased the prevalence of touch screens and have prompted a wave of new touch screen-based devices. However, touch screens are st...
CORR
2010
Springer
13 years 7 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...
SYNTHESE
2010
13 years 5 months ago
2010
There exists a considerable body of work on epistemic logics for resource-bounded reasoners. In this paper, we concentrate on a less studied aspect of resource-bounded reasoning, n...
MM
2006
ACM
14 years 1 months ago
2006
ACM
Computer vision researchers have recently proposed several local descriptor schemes. Due to lack of database support, however, these descriptors have only been evaluated using sma...