14548 search results - page 2611 / 2910 » The Optimal Path-Matching Problem |
148
click to vote
KI
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Many heuristic estimators for classical planning are based on the socalled delete relaxation, which ignores negative effects of planning operators. Ideally, such heuristi...
183
click to vote
PKDD
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Feature selection in reinforcement learning (RL), i.e. choosing basis functions such that useful approximations of the unkown value function can be obtained, is one of th...
189
click to vote
PKDD
2009
Springer
16 years 1 months ago
2009
Springer
The goal of approximate policy evaluation is to “best” represent a target value function according to a specific criterion. Temporal difference methods and Bellman residual m...
181
click to vote
ASPDAC
2009
ACM
16 years 1 months ago
2009
ACM
—Considering process variability at the behavior synthesis level is necessary, because it makes some instances of function units slower and others faster, resulting in unbalanced...
172
click to vote
ASPDAC
2009
ACM
16 years 1 months ago
2009
ACM
— Thermal balancing and reducing hot-spots are two important challenges facing the MPSoC designers. In this work, we model the thermal behavior of a MPSoC as a control theory pro...