2880 search results - page 91 / 576 » Approximate Range Searching |
115
Voted
TACAS
2010
Springer
15 years 8 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...
108
click to vote
AIPS
2007
15 years 5 months ago
2007
Relaxations based on (either complete or partial) ignoring delete effects of the actions provide the basis for some seminal classical planning heuristics. However, the palette of ...
110
Voted
CIKM
2010
Springer
15 years 1 months ago
2010
Springer
Pseudo-relevance feedback (PRF) improves search quality by expanding the query using terms from high-ranking documents from an initial retrieval. Although PRF can often result in ...
152
click to vote
SODA
2012
ACM
13 years 5 months ago
2012
ACM
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
123
click to vote
AMAI
2004
Springer
15 years 8 months ago
2004
Springer
The majority of the work in the area of Markov decision processes has focused on expected values of rewards in the objective function and expected costs in the constraints. Althou...