( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Generalizing Refinement Operators to Learn Prenex Conjunctive Normal Forms.

, , , и . ILP, том 1634 из Lecture Notes in Computer Science, стр. 245-256. Springer, (1999)

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.

Laura Ramón Giménez

Julijus Algirdas Ramonas

Lutz Ramonat

Wolfgang Ramonat

Oliver Ramonat

 

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

Multi-Agent Relational Reinforcement Learning. Explorations in Multi-State Coordination Tasks, , , и . Learning and Adaptation in Multi-Agent Systems, том 3898 из Lecture Notes in Artificial Intelligence, Springer Verlag, Berlin, (2006)An evolutionary game-theoretic analysis of poker strategies, , , и . Entertainment Computing, 1, стр. 39-45. (2009)Improving the Efficiency of Inductive Logic Programming Through the Use of Query Packs, , , , , и . CoRR, (2011)Learning directed probabilistic logical models: ordering-search versus structure-search., , , и . Ann. Math. Artif. Intell., 54 (1-3): 99-133 (2008)Expressivity versus Efficiency of Graph Kernels, и . Proceedings of the First International Workshop on Mining Graphs, Trees and Sequences (MGTS 2003) at the 14th European Conference on Machine Learning and 7th European Conference on Principles and Practice of Knowledge Discovery in Databases (ECML/PKDD 2003), September 22 and 23, 2003, Cavtat-Dubrovnik, Croatia, стр. 65--74. (2003)An Efficiently Computable Support Measure for Frequent Subgraph Pattern Mining., и . ECML/PKDD (1), том 7523 из Lecture Notes in Computer Science, стр. 362-377. Springer, (2012)Searching for Compound Goals Using Relevancy Zones in the Game of Go., и . Computers and Games, том 3846 из Lecture Notes in Computer Science, стр. 113-128. Springer, (2004)Online Learning and Exploiting Relational Models in Reinforcement Learning., , , и . IJCAI, стр. 726-731. (2007)Naive Infinite Enumeration of Context-free Languages in Incremental Polynomial Time., , , , и . J. Univers. Comput. Sci., 21 (7): 891-911 (2015)Learning Directed Probabilistic Logical Models: Ordering-Search Versus Structure-Search., , , и . ECML, том 4701 из Lecture Notes in Computer Science, стр. 567-574. Springer, (2007)