Sciweavers

4435 search results - page 278 / 887
» Algorithms, games, and the internet
Sort
View
SODA
2010
ACM
149views Algorithms» more  SODA 2010»
16 years 4 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
CORR
2007
Springer
106views Education» more  CORR 2007»
15 years 6 months ago
Bandit Algorithms for Tree Search
Bandit based methods for tree search have recently gained popularity when applied to huge trees, e.g. in the game of go [6]. Their efficient exploration of the tree enables to ret...
Pierre-Arnaud Coquelin, Rémi Munos
AAAI
2006
15 years 8 months ago
Point-based Dynamic Programming for DEC-POMDPs
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...
Daniel Szer, François Charpillet
FOCS
2007
IEEE
16 years 1 months ago
Towards Sharp Inapproximability For Any 2-CSP
We continue the recent line of work on the connection between semidefinite programming-based approximation algorithms and the Unique Games Conjecture. Given any boolean 2-CSP (or...
Per Austrin
ATAL
2003
Springer
16 years 21 hour 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...