Sciweavers

533 search results - page 74 / 107
» Playing games with approximation algorithms
Sort
View
TIP
2008
133views more  TIP 2008»
13 years 7 months ago
A Recursive Model-Reduction Method for Approximate Inference in Gaussian Markov Random Fields
This paper presents recursive cavity modeling--a principled, tractable approach to approximate, near-optimal inference for large Gauss-Markov random fields. The main idea is to su...
Jason K. Johnson, Alan S. Willsky
ATAL
2003
Springer
14 years 25 days ago
Locating moving entities in indoor environments with teams of mobile robots
This article presents an implemented multi-robot system for playing the popular game of laser tag. The object of the game is to search for and tag opponents that can move freely a...
Matthew Rosencrantz, Geoffrey J. Gordon, Sebastian...
SODA
2010
ACM
149views Algorithms» more  SODA 2010»
14 years 5 months ago
Sharp kernel clustering algorithms and their associated Grothendieck inequalities
abstract Subhash Khot Assaf Naor In the kernel clustering problem we are given a (large) n ? n symmetric positive semidefinite matrix A = (aij) with n i=1 n j=1 aij = 0 and a (sma...
Subhash Khot, Assaf Naor
ICALP
2004
Springer
14 years 1 months ago
The Power of Verification for One-Parameter Agents
We initiate the study of mechanisms with verification for one-parameter agents. We give an algorithmic characterization of such mechanisms and show that they are provably better ...
Vincenzo Auletta, Roberto De Prisco, Paolo Penna, ...
TON
2008
139views more  TON 2008»
13 years 7 months ago
Stochastic learning solution for distributed discrete power control game in wireless data networks
Distributed power control is an important issue in wireless networks. Recently, noncooperative game theory has been applied to investigate interesting solutions to this problem. Th...
Yiping Xing, Rajarathnam Chandramouli