( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Planning from Pixels in Environments with Combinatorially Hard Search Spaces.

, , , и . NeurIPS, стр. 24707-24718. (2021)

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.

Miroslav Angelov

Miroslav Kroutvar

Miroslav Kocúr

Miroslav Batchkarov

Miroslav Hamouz

 

Другие публикации лиц с тем же именем

Loop conditions for strongly connected digraphs.. Int. J. Algebra Comput., 30 (03): 467-499 (2020)Reinforcement Learning of Theorem Proving., , , и . NeurIPS, стр. 8836-8847. (2018)Maltsev conditions for General Congruence Meet-semidistributive Algebras.. J. Symb. Log., 86 (4): 1432-1451 (2021)Learning Theorem Proving Components., , , и . TABLEAUX, том 12842 из Lecture Notes in Computer Science, стр. 266-278. Springer, (2021)The Isabelle ENIGMA., , , , , и . ITP, том 237 из LIPIcs, стр. 16:1-16:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems., , , , и . LICS, стр. 1-12. IEEE Computer Society, (2017)Erratum: Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures., , , , и . J. Math. Log., 21 (2): 2192001:1 (2021)Alien Coding., , и . CoRR, (2023)Learning to Solve Geometric Construction Problems from Images., , , , и . CICM, том 12833 из Lecture Notes in Computer Science, стр. 167-184. Springer, (2021)The Role of Entropy in Guiding a Connection Prover., , и . TABLEAUX, том 12842 из Lecture Notes in Computer Science, стр. 218-235. Springer, (2021)