672 search results - page 115 / 135 » Policy Search by Dynamic Programming |
SIGMOD
2009
ACM
15 years 6 months ago
2009
ACM
The state of the art commercial query optimizers employ cost-based optimization and exploit dynamic programming (DP) to find the optimal query execution plan (QEP) without evalua...
86
Voted
SC
2009
ACM
15 years 6 months ago
2009
ACM
Algorithmic choice is essential in any problem domain to realizing optimal computational performance. Multigrid is a prime example: not only is it possible to make choices at the ...
111
click to vote
BMCBI
2008
14 years 12 months ago
2008
Background: Searching for similarities in protein and DNA databases has become a routine procedure in Molecular Biology. The Smith-Waterman algorithm has been available for more t...
121
click to vote
JAIR
2006
14 years 11 months ago
2006
A decision process in which rewards depend on history rather than merely on the current state is called a decision process with non-Markovian rewards (NMRDP). In decisiontheoretic...
ICDCS
2007
IEEE
15 years 6 months ago
2007
IEEE
In this paper, we propose and prove correct a distributed stabilizing implementation of an overlay, called DR-tree, optimized for efficient selective dissemination of information...