7129 search results - page 542 / 1426 » Approximation Algorithms for Treewidth |
194
click to vote
ATAL
2008
Springer
15 years 9 months ago
2008
Springer
In this paper we address the problem of coordination in multi-agent sequential decision problems with infinite statespaces. We adopt a game theoretic formalism to describe the int...
216
click to vote
COMPGEOM
2005
ACM
15 years 9 months ago
2005
ACM
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...
186
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
We present a method to maintain a mesh approximating a deforming surface, which is specified by a dense set of sample points. We identify a reasonable motion model for which a pro...
177
click to vote
NIPS
2003
15 years 8 months ago
2003
Recent developments in grid-based and point-based approximation algorithms for POMDPs have greatly improved the tractability of POMDP planning. These approaches operate on sets of...
191
click to vote
FUIN
2006
15 years 7 months ago
2006
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...