5995 search results - page 418 / 1199 » Algorithmic Game Theory |
174
click to vote
ECCC
2007
15 years 7 months ago
2007
Abstract. Combining classical approximability questions with parameterized complexity, we introduce a theory of parameterized approximability. The main intention of this theory is ...
143
click to vote
MOC
2000
15 years 7 months ago
2000
Resolutions of cusp singularities are crucial to many techniques in computational number theory, and therefore finding explicit resolutions of these singularities has been the focu...
209
click to vote
SIGCSE
2002
ACM
15 years 7 months ago
2002
ACM
This paper will present the Interactive Pushdown Automata Animation for use in an Automata Theory class. It will present the features of the IPAA as well as the algorithm and data...
174
click to vote
SIGMOD
2008
ACM
15 years 7 months ago
2008
ACM
Jim Gray spent a decade as a student and researcher at Berkeley. In action, he is remembered for his breath, his depth, and his generosity. Categories and Subject Descriptors K.1 ...
233
click to vote
STOC
2009
ACM
16 years 8 months ago
2009
ACM
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...