Steven I. Marcus – författare
Visar alla böcker från författaren Steven I. Marcus. Handla med fri frakt och snabb leverans.
5 produkter
Simulation-Based Algorithms for Markov Decision Processes
Av Hyeong Soo Chang, Jiaqiao Hu m. fl.
Inbunden, 2013
1096 kr
Lägg i varukorg
Markov decision process (MDP) models are widely used for modeling sequential decision-making problems that arise in engineering, economics, computer science, and the social sciences. Many real-world problems modeled by MDPs have huge state and/or action spaces, giving an opening to the curse of …
Simulation-Based Algorithms for Markov Decision Processes
Av Steven I. Marcus, Michael C. Fu m. fl.
E-bok, 2013
1459 kr
Lägg i varukorg
Markov decision process (MDP) models are widely used for modeling sequential decision-making problems that arise in engineering, economics, computer science, and the social sciences. Many real-world problems modeled by MDPs have huge state and/or action spaces, giving an opening to the curse of …
Simulation-Based Algorithms for Markov Decision Processes
Av Hyeong Soo Chang, Jiaqiao Hu m. fl.
Häftad, 2015
1096 kr
Lägg i varukorg
Markov decision process (MDP) models are widely used for modeling sequential decision-making problems that arise in engineering, economics, computer science, and the social sciences. Many real-world problems modeled by MDPs have huge state and/or action spaces, giving an opening to the curse of …
Simulation-based Algorithms for Markov Decision Processes
Av Steven I. Marcus, Jiaqiao Hu m. fl.
E-bok, 2007
1491 kr
Lägg i varukorg
Often, real-world problems modeled by Markov decision processes (MDPs) are difficult to solve in practise because of the curse of dimensionality. In others, explicit specification of the MDP model parameters is not feasible, but simulation samples are available. For these settings, various sampling …
Simulation-based Algorithms for Markov Decision Processes
Av Hyeong Soo Chang, Michael C. Fu m. fl.
Häftad, 2010
1521 kr
Tillfälligt slut
Often, real-world problems modeled by Markov decision processes (MDPs) are difficult to solve in practise because of the curse of dimensionality. In others, explicit specification of the MDP model parameters is not feasible, but simulation samples are available. For these settings, various sampling …