( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Online Rule Learning via Weighted Model Counting.

. ECAI, том 178 из Frontiers in Artificial Intelligence and Applications, стр. 112-116. IOS Press, (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.

Frédéric Robin

Frédéric Ruckert

Frédéric Roux

Frédéric Leroux

Frédéric Ziebarth

 

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

Knowledge Compilation for Model Counting: Affine Decision Trees., , , и . IJCAI, стр. 947-953. IJCAI/AAAI, (2013)Best Heuristic Identification for Constraint Satisfaction., , , и . IJCAI, стр. 1859-1865. ijcai.org, (2022)Acquiring Constraint Networks Using a SAT-based Version Space Algorithm., , , и . AAAI, стр. 1565-1568. AAAI Press, (2006)Les raisons majoritaires : des explications abductives pour les forêts aléatoires., , , , , и . EGC, том E-38 из RNTI, стр. 123-134. Editions RNTI, (2022)Fault-Tolerant and Approximate Reasoning in Multi-Source Environments.. CoopIS, стр. 66-72. IEEE Computer Society, (1997)Trading Complexity for Sparsity in Random Forest Explanations., , , , , и . AAAI, стр. 5461-5469. AAAI Press, (2022)Compiling Combinatorial Prediction Games.. ICML, том 80 из Proceedings of Machine Learning Research, стр. 2761-2770. PMLR, (2018)Robust k-DNF Learning via Inductive Belief Merging., и . ECML, том 2837 из Lecture Notes in Computer Science, стр. 229-240. Springer, (2003)A SAT-Based Version Space Algorithm for Acquiring Constraint Satisfaction Problems., , , и . ECML, том 3720 из Lecture Notes in Computer Science, стр. 23-34. Springer, (2005)Approximate Reasoning about Combined Knowledge.. ATAL, том 1365 из Lecture Notes in Computer Science, стр. 259-273. Springer, (1997)