350 search results - page 40 / 70 » Approximation Algorithms for Unique Games |
129
Voted
TSP
2008
15 years 2 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
162
Voted
STOC
2012
ACM
13 years 4 months ago
2012
ACM
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...
118
click to vote
AAAI
2006
15 years 3 months ago
2006
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...
127
Voted
ICRA
2005
IEEE
15 years 8 months ago
2005
IEEE
— In the real world, noisy sensors and limited communication make it difficult for robot teams to coordinate in tightly coupled tasks. Team members cannot simply apply single-ro...
130
Voted
AIIDE
2006
15 years 3 months ago
2006
Reinforcement learning is an effective machine learning paradigm in domains represented by compact and discrete state-action spaces. In high-dimensional and continuous domains, ti...