PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Patrascu, Relu"

Author of the publication

copydeleteadd this publication to your clipboard
Sequentially Fitting ``Inclusive'' Trees for Inference in Noisy-OR Networks.

, , , and . NIPS, page 493-499. MIT Press, (2000)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Patrascu, Relu
add a person with the name Patrascu, Relu
 

Other publications of authors with the same name

Constraint-based optimization and utility elicitation using the minimax decision criterion., , , and . Artif. Intell., 170 (8-9): 686-713 (2006)New Approaches to Optimization and Utility Elicitation in Autonomic Computing., , , , , and . AAAI, page 140-145. AAAI Press / The MIT Press, (2005)Direct value-approximation for factored MDPs., and . NIPS, page 1579-1586. MIT Press, (2001)Piecewise Linear Value Function Approximation for Factored MDPs., , , and . AAAI/IAAI, page 292-299. AAAI Press / The MIT Press, (2002)Algorithm-Directed Exploration for Model-Based Reinforcement Learning in Factored MDPs., , and . ICML, page 235-242. Morgan Kaufmann, (2002)Regret-based Utility Elicitation in Constraint-based Decision Problems., , , and . IJCAI, page 929-934. Professional Book Center, (2005)Investigating the Maximum Likelihood Alternative to TD(lambda)., , and . ICML, page 403-410. Morgan Kaufmann, (2002)Sequentially Fitting ``Inclusive'' Trees for Inference in Noisy-OR Networks., , , and . NIPS, page 493-499. MIT Press, (2000)Greedy Linear Value-Approximation for Factored Markov Decision Processes., , , , and . AAAI/IAAI, page 285-291. AAAI Press / The MIT Press, (2002)Constraint-Based Optimization with the Minimax Decision Criterion., , , and . CP, volume 2833 of Lecture Notes in Computer Science, page 168-182. Springer, (2003)