首页 /研究 /Maximal coverage problems with routing constraints using cross-entropy Monte Carlo tree search
OTHER

Maximal coverage problems with routing constraints using cross-entropy Monte Carlo tree search

Pao-Te Lin, Kuo-Shih Tseng

发表年份
2024
引用次数
4

关键词

Computer scienceMonte Carlo tree searchCross-entropy methodMonte Carlo methodBenchmark (surveying)Mathematical optimizationKey (lock)Entropy (arrow of time)AlgorithmCross entropy

相关论文

查看 OTHER 分类全部论文