1469 search results - page 129 / 294 » Approximate polynomial decomposition |
178
click to vote
COCOON
2003
Springer
16 years 2 days ago
2003
Springer
Abstract. While the original stable marriage problem requires all participants to rank all members of the opposite sex in a strict order, two natural variations are to allow for in...
181
click to vote
ICALP
1998
Springer
15 years 11 months ago
1998
Springer
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...
194
click to vote
AAAI
2007
15 years 9 months ago
2007
Efficient query answering over ontologies is one of the most useful and important services to support Semantic Web applications. Approximation has been identified as a potential...
184
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizatio...
179
click to vote
SIROCCO
2008
15 years 8 months ago
2008
We consider the problem of computing -approximate Nash equilibria in network congestion games. The general problem is known to be PLS-complete for every > 0, but the reductions...