( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A SAT-Based Approach for Enumerating Interesting Patterns from Uncertain Data.

, , , , и . ICTAI, стр. 255-262. IEEE Computer Society, (2016)

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.

Lakhdar Akroun

Siham Sais

Anne Saison

Victor Ricardo Enriquez Sais

 

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

On Maximal Frequent Itemsets Enumeration., , и . SoCPaR, том 737 из Advances in Intelligent Systems and Computing, стр. 151-160. Springer, (2017)A Bayesian Monte Carlo method for computing the Shapley value: Application to weighted voting and bin packing games., , и . Comput. Oper. Res., (2021)Efficient SAT-Based Encodings of Conditional Cardinality Constraints., , , и . LPAR, том 57 из EPiC Series in Computing, стр. 181-195. EasyChair, (2018)Extracting MUCs from Constraint Networks., , , и . ECAI, том 141 из Frontiers in Artificial Intelligence and Applications, стр. 113-117. IOS Press, (2006)Tractable Cover Compilations., , , , и . IJCAI (1), стр. 122-127. Morgan Kaufmann, (1997)Représentations compactes des graphes et contraintes pseudo booléennes., , , и . EGC, том E-35 из RNTI, стр. 407-412. Éditions RNTI, (2019)A SAT-Based Framework for Overlapping Community Detection in Networks., , , и . PAKDD (2), том 10235 из Lecture Notes in Computer Science, стр. 786-798. (2017)Prime Implicates Based Inconsistency Characterization., , , и . ECAI, том 263 из Frontiers in Artificial Intelligence and Applications, стр. 1037-1038. IOS Press, (2014)A Symbolic Approach to Computing Disjunctive Association Rules from Data., , и . IJCAI, стр. 2133-2141. ijcai.org, (2023)Intensification Search in Modern SAT Solvers - (Poster Presentation)., , и . SAT, том 7317 из Lecture Notes in Computer Science, стр. 491-492. Springer, (2012)