6365 search results - page 398 / 1273 » Fast Local Computation Algorithms |
195
Voted
WINE
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...
172
click to vote
ICPR
2008
IEEE
16 years 8 months ago
2008
IEEE
We propose an iterative scheme of spatio-temporal local color transformation of background and graphcut segmentation for silhouette extraction. Given an initial background subtrac...
175
Voted
CIKM
2009
Springer
16 years 2 months ago
2009
Springer
To increase the relevancy of local patterns discovered from noisy relations, it makes sense to formalize error-tolerance. Our starting point is to address the limitations of state...
196
Voted
IWPEC
2009
Springer
16 years 2 months ago
2009
Springer
We study the Hospitals/Residents with Couples problem, a variant of the classical Stable Marriage problem. This is the extension of the Hospitals/Residents problem where residents ...
208
Voted
ICTAI
2007
IEEE
16 years 1 months ago
2007
IEEE
Unlike mono-agent systems, multi-agent planing addresses the problem of resolving conflicts between individual and group interests. In this paper, we are using a Decentralized Ve...