4403 search results - page 630 / 881 » Galois Theory of Algorithms |
206
click to vote
TREC
2004
15 years 8 months ago
2004
The quality of an information retrieval system heavily depends on its retrieval function, which returns a similarity measurement between the query and each document in the collect...
230
click to vote
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
209
click to vote
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
In the strategyproof classification setting, a set of labeled examples is partitioned among multiple agents. Given the reported labels, an optimal classification mechanism returns...
232
click to vote
FSTTCS
2008
Springer
15 years 8 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
228
click to vote
GC
2008
Springer
15 years 7 months ago
2008
Springer
In this paper we study the class of weakly quasi-threshold graphs that are obtained from a vertex by recursively applying the operations (i) adding a new isolated vertex, (ii) addi...