2128 search results - page 221 / 426 » A general characterization of indulgence |
197
click to vote
LPNMR
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. The recently proposed notion of an elementary set yielded a refinement of the theorem on loop formulas, telling us that the stable models of a disjunctive logic program ...
181
click to vote
NETCOOP
2007
Springer
16 years 1 months ago
2007
Springer
The Tit-for-Tat strategy implemented in BitTorrent (BT) clients is generally considered robust to selfish behaviours. The authors of [1] support this belief studying how Tit-for-T...
193
click to vote
WINE
2007
Springer
16 years 1 months ago
2007
Springer
We consider a model of content contribution in peer-to-peer networks with linear quadratic payoffs and very general interaction patterns. We find that Nash equilibria of this gam...
184
click to vote
FOCS
2006
IEEE
16 years 1 months ago
2006
IEEE
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
188
click to vote
FOCS
2006
IEEE
16 years 1 months ago
2006
IEEE
d abstract] Robert Krauthgamer ∗ IBM Almaden James R. Lee † Institute for Advanced Study We initiate the study of approximate algorithms on negatively curved spaces. These spa...