3946 search results - page 76 / 790 » The computational complexity of choice sets |
FSTTCS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Given two simplicial complexes C1 and C2 embedded in Euclidean space IRd , C1 subdivides C2 if (i) C1 and C2 have the same underlying space, and (ii) every simplex in C1 ...
DCC
1999
IEEE
15 years 4 months ago
1999
IEEE
In this paper we consider the problem of searching for the best match for an input among a set of vectors, according to some predetermined metric. Examples of this problem include...
JAIR
2008
14 years 12 months ago
2008
We consider the problem of allocating fairly a set of indivisible goods among agents from the point of view of compact representation and computational complexity. We start by ass...
CP
2008
Springer
15 years 1 months ago
2008
Springer
We introduce the SoftAllEqual global constraint, which maximizes the number of equalities holding between pairs of assignments to a set of variables. We study the computational com...
TACAS
2009
Springer
15 years 6 months ago
2009
Springer
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...