1279 search results - page 96 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
103
Voted
STOC
2007
ACM
16 years 2 months ago
2007
ACM
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...
138
click to vote
ATAL
2008
Springer
15 years 3 months ago
2008
Springer
When exploring a game over a large strategy space, it may not be feasible or cost-effective to evaluate the payoff of every relevant strategy profile. For example, determining a p...
120
click to vote
ATAL
2007
Springer
15 years 8 months ago
2007
Springer
A problem of planning for cooperative teams under uncertainty is a crucial one in multiagent systems. Decentralized partially observable Markov decision processes (DECPOMDPs) prov...
108
Voted
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
XCS with computed prediction, namely XCSF, has been recently extended in several ways. In particular, a novel prediction update algorithm based on recursive least squares and the ...
117
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...