2698 search results - page 91 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
148
click to vote
TACAS
2010
Springer
15 years 11 months ago
2010
Springer
We propose a general methodology for approximating the Pareto front of multi-criteria optimization problems. Our search-based methodology consists of submitting queries to a constr...
149
click to vote
STOC
2010
ACM
15 years 10 months ago
2010
ACM
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
198
click to vote
UAI
2008
15 years 7 months ago
2008
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
151
click to vote
FCT
2003
Springer
15 years 11 months ago
2003
Springer
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
180
click to vote
UAI
1998
15 years 7 months ago
1998
This paper presents two new approaches to decomposing and solving large Markov decision problems (MDPs), a partial decoupling method and a complete decoupling method. In these app...