{"title":"Optimized Look-ahead Tree Search Policies","authors":"Francis Maes, L. Wehenkel, D. Ernst","doi":"10.1007/978-3-642-29946-9_20","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":432284,"journal":{"name":"European Workshop on Reinforcement Learning","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Workshop on Reinforcement Learning","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-642-29946-9_20","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
京公网安备 11010802042870号
求助内容：
应助结果提醒方式：
