3946 search results - page 147 / 790 » The computational complexity of choice sets |
170
click to vote
SIGACT
2008
15 years 6 months ago
2008
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...
151
click to vote
JAIR
2006
15 years 6 months ago
2006
In a field of research about general reasoning mechanisms, it is essential to have appropriate benchmarks. Ideally, the benchmarks should reflect possible applications of the deve...
165
click to vote
FSS
2006
15 years 6 months ago
2006
Among the various extensions to the common [0, 1]-valued truth degrees of "traditional" fuzzy set theory, closed intervals of [0, 1] stand out as a particularly appealin...
236
click to vote
SIGECOM
2011
ACM
14 years 9 months ago
2011
ACM
In many settings, a group of agents must come to a joint decision on multiple issues. In practice, this is often done by voting on the issues in sequence. In this paper, we model ...
173
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: High-throughput methods for detecting protein-protein interactions enable us to obtain large interaction networks, and also allow us to computationally identify the as...