1092 search results - page 71 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
182
click to vote
ATAL
2009
Springer
16 years 15 days ago
2009
Springer
Coalition formation is a key topic in multi–agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encoura...
161
click to vote
FOCS
2006
IEEE
15 years 12 months ago
2006
IEEE
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
188
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
Given a collection of complex, time-stamped events, how do we find patterns and anomalies? Events could be meetings with one or more persons with one or more agenda items at zero ...
178
click to vote
STOC
2010
ACM
16 years 3 months ago
2010
ACM
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
167
click to vote
RECOMB
1997
Springer
15 years 10 months ago
1997
Springer
The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nade...