6315 search results - page 159 / 1263 » Approximating Solution Structure |
182
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
166
click to vote
WINE
2007
Springer
16 years 16 days ago
2007
Springer
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...
161
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
The fundamental operation of dominance testing, i.e., determining if one alternative is preferred to another, is in general very hard for methods of reasoning with qualitative cond...
185
click to vote
SIAMMAX
2010
15 years 1 months ago
2010
For the approximation of time-dependent data tensors and of solutions to tensor differential equations by tensors of low Tucker rank, we study a computational approach that can be ...
185
click to vote
SEMWEB
2010
Springer
15 years 4 months ago
2010
Springer
We develop query relaxation techniques for regular path queries and combine them with query approximation in order to support flexible querying of RDF data when the user lacks know...