Sciweavers

4372 search results - page 512 / 875
» Algorithmic Theories of Everything
Sort
View
ATAL
2010
Springer
15 years 8 months ago
Heuristic search for identical payoff Bayesian games
Bayesian games can be used to model single-shot decision problems in which agents only possess incomplete information about other agents, and hence are important for multiagent co...
Frans A. Oliehoek, Matthijs T. J. Spaan, Jilles St...
CORR
2006
Springer
160views Education» more  CORR 2006»
15 years 6 months ago
Frugality ratios and improved truthful mechanisms for vertex cover
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
SAGT
2010
Springer
164views Game Theory» more  SAGT 2010»
15 years 5 months ago
On Nash-Equilibria of Approximation-Stable Games
Abstract. One reason for wanting to compute an (approximate) Nash equilibrium of a game is to predict how players will play. However, if the game has multiple equilibria that are f...
Pranjal Awasthi, Maria-Florina Balcan, Avrim Blum,...
CVPR
1997
IEEE
16 years 8 months ago
Recursive Structure and Motion from Image Sequences using Shape and Depth Spaces
In this paper a novel recursive method for estimating structure and motion from image sequences is presented. The novelty lies in the fact that the output of the algorithm is inde...
Rikard Berthilsson, Anders Heyden, Gunnar Sparr
CVPR
2003
IEEE
16 years 8 months ago
Clustering Appearances of Objects Under Varying Illumination Conditions
We introduce two appearance-based methods for clustering a set of images of 3-D objects, acquired under varying illumination conditions, into disjoint subsets corresponding to ind...
Jeffrey Ho, Ming-Hsuan Yang, Jongwoo Lim, Kuang-Ch...