Minimizing simple and cumulative regret in Monte-Carlo tree search.- on robustness of CMAB algorithms.- Experimental approach.- Job-level algorithms for "Connect6" opening position analysis.- Monte-Carlo tree search and minimax hybrids with heuristic evaluation functions.- Monte-Carlo tree search for the game of "7 Wonders".- Small and large MCTS playouts applied to Chinese Dark Chess Stochastic Game.- On the complexity of general game playing.- Efficient grounding of game descriptions with tabling.- SHPE: HTN planning for video games.- Predicting player disengagement in online games.- Coordinating dialogue systems and stories through behavior composition.
This title is in stock with our Australian supplier and should arrive at our Sydney warehouse within 1 - 2 weeks of you placing an order.
Once received into our warehouse we will despatch it to you with a Shipping Notification which includes online tracking.
Please check the estimated delivery times below for your region, for after your order is despatched from our warehouse:
ACT Metro: 2 working days
NSW Metro: 2 working days
NSW Rural: 2-3 working days
NSW Remote: 2-5 working days
NT Metro: 3-6 working days
NT Remote: 4-10 working days
QLD Metro: 2-4 working days
QLD Rural: 2-5 working days
QLD Remote: 2-7 working days
SA Metro: 2-5 working days
SA Rural: 3-6 working days
SA Remote: 3-7 working days
TAS Metro: 3-6 working days
TAS Rural: 3-6 working days
VIC Metro: 2-3 working days
VIC Rural: 2-4 working days
VIC Remote: 2-5 working days
WA Metro: 3-6 working days
WA Rural: 4-8 working days
WA Remote: 4-12 working days
Share This Book: