159 search results - page 15 / 32 » Computational Complexity of Fundamental Problems in Social C... |
SIGECOM
2006
ACM
15 years 5 months ago
2006
ACM
We investigate the space of two-sided multiattribute auctions, focusing on the relationship between constraints on the offers traders can express through bids, and the resulting c...
124
click to vote
AAAI
2012
13 years 2 months ago
2012
The complexity of the winner determination problem has been studied for almost all common voting rules. A notable exception, possibly caused by some confusion regarding its exact ...
GROUP
2003
ACM
15 years 5 months ago
2003
ACM
Data are a fundamental component of science and engineering work, and the ability to share data is critical to the validation and progress of science. Data sharing and reuse in so...
STOC
2010
ACM
15 years 3 months ago
2010
ACM
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
104
click to vote
TPHOL
2005
IEEE
15 years 5 months ago
2005
IEEE
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...