( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Solving Multiobjective Discrete Optimization Problems with Propositional Minimal Model Generation.

, , , и . CP, том 10416 из Lecture Notes in Computer Science, стр. 596-614. Springer, (2017)

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.

Takehide Senuma

Soh-Yeon Won

Soh-Yeun Yun

Jan Hendrik Sohl

Alternativer Risikotransfer zur Solvabilitätssteuerung in Schadenversicherungsunternehmen. NA Duisburg-Essen, (2009)

Bonaventure Soh Bejeng Ndikung

 

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

Implementing Efficient All Solutions SAT Solvers., и . CoRR, (2015)Implementing Efficient All Solutions SAT Solvers., и . ACM J. Exp. Algorithmics, 21 (1): 1.12:1-1.12:44 (2016)ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems., , , , , , и . CoRR, (2022)Compiling Pseudo-Boolean Constraints to SAT with Order Encoding., , и . ICTAI, стр. 1020-1027. IEEE Computer Society, (2013)Lemma Reusing for SAT based Planning and Scheduling., , , и . ICAPS, стр. 103-113. AAAI, (2006)Proposal and Evaluation of Hybrid Encoding of CSP to SAT Integrating Order and Log Encodings., , и . Int. J. Artif. Intell. Tools, 26 (1): 1760005:1-1760005:29 (2017)SAT-Based Method for Finding Attractors in Asynchronous Multi-Valued Networks., , , , и . BIOINFORMATICS, стр. 163-174. SCITEPRESS, (2023)Hamiltonian Cycle Reconfiguration with Answer Set Programming., , , , , , , и . JELIA, том 14281 из Lecture Notes in Computer Science, стр. 262-277. Springer, (2023)SAF: SAT-Based Attractor Finder in Asynchronous Automata Networks., , , , и . CMSB, том 14137 из Lecture Notes in Computer Science, стр. 175-183. Springer, (2023)Identifying Necessary Reactions in Metabolic Pathways by Minimal Model Generation., и . ECAI, том 215 из Frontiers in Artificial Intelligence and Applications, стр. 277-282. IOS Press, (2010)