672 search results - page 61 / 135 » Policy Search by Dynamic Programming |
SIGUCCS
2000
ACM
13 years 11 months ago
2000
ACM
Anyone who works with student employees knows that while it is often difficult to train sufficiently, it is of the utmost importance to have a qualified, knowledgeable staff. We w...
SEBD
1997
13 years 9 months ago
1997
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, ...
AI
1999
Springer
13 years 7 months ago
1999
Springer
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
Building adaptive constraint solvers is a major challenge in constraint programming. An important line of research towards this goal is concerned with ways to dynamically adapt th...
PEPM
1997
ACM
13 years 12 months ago
1997
ACM
We present the design of a dynamic compilation system for C. Directed by a few declarative user annotations specifying where and on what dynamic compilation is to take place, a bi...