( en | de | ru )

 

Disambiguation of "Ramon, Jan"

Author of the publication

copydeleteadd this publication to your clipboard
Learning directed probabilistic logical models: ordering-search versus structure-search.

, , , and . Ann. Math. Artif. Intell., 54 (1-3): 99-133 (2008)

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.

Laura Ramón Giménez

Julijus Algirdas Ramonas

Lutz Ramonat

Oliver Ramonat

Wolfgang Ramonat

 

Other publications of authors with the same name

Multi-Agent Relational Reinforcement Learning. Explorations in Multi-State Coordination Tasks, , , and . Learning and Adaptation in Multi-Agent Systems, volume 3898 of Lecture Notes in Artificial Intelligence, Springer Verlag, Berlin, (2006)An evolutionary game-theoretic analysis of poker strategies, , , and . Entertainment Computing, 1, page 39-45. (2009)Improving the Efficiency of Inductive Logic Programming Through the Use of Query Packs, , , , , and . CoRR, (2011)Learning directed probabilistic logical models: ordering-search versus structure-search., , , and . Ann. Math. Artif. Intell., 54 (1-3): 99-133 (2008)Searching for Compound Goals Using Relevancy Zones in the Game of Go., and . Computers and Games, volume 3846 of Lecture Notes in Computer Science, page 113-128. Springer, (2004)Learning Directed Probabilistic Logical Models: Ordering-Search Versus Structure-Search., , , and . ECML, volume 4701 of Lecture Notes in Computer Science, page 567-574. Springer, (2007)Compact Representation of Knowledge Bases in ILP., , and . ILP, volume 2583 of Lecture Notes in Computer Science, page 254-269. Springer, (2002)Naive Infinite Enumeration of Context-free Languages in Incremental Polynomial Time., , , , and . J. Univers. Comput. Sci., 21 (7): 891-911 (2015)Modeling Machine Learning and Data Mining Problems with FO(·)., , , , , , , , and . ICLP (Technical Communications), volume 17 of LIPIcs, page 14-25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)An Efficiently Computable Support Measure for Frequent Subgraph Pattern Mining., and . ECML/PKDD (1), volume 7523 of Lecture Notes in Computer Science, page 362-377. Springer, (2012)