71 search results - page 5 / 15 » Relative Entropy Policy Search |
AIPS
2008
15 years 2 months ago
2008
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...
110
click to vote
JAIR
2011
14 years 6 months ago
2011
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are wort...
CCS
2009
ACM
16 years 8 days ago
2009
ACM
The successful deployment of a security policy is closely related not only to the complexity of the security requirements but also to the capabilities/functionalities of the secur...
98
Voted
ATAL
2010
Springer
15 years 23 days ago
2010
Springer
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...
CCS
2010
ACM
14 years 9 months ago
2010
ACM
Cross-domain information exchange is a growing problem, as business and governmental organizations increasingly need to integrate their information systems with those of partially...