( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Equivalent Formulations of the Oxygen Depletion Problem, Other Implicit Moving Boundary Value Problems, and Implications for Numerical Approximation.

, , и . SIAM J. Appl. Math., 83 (1): 52-78 (февраля 2023)

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.

Zhaohui Guo

Zhaohui Luo

Zhaohui Chen

Zhaohui Liu

Zhaohui Tong

 

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

Shortest path problem with cache dependent path lengths., , , и . IEEE Congress on Evolutionary Computation, стр. 2756-2761. IEEE, (2003)On Solving the Partial MAX-SAT Problem., и . SAT, том 4121 из Lecture Notes in Computer Science, стр. 252-265. Springer, (2006)Solving the minimum-cost satisfiability problem using SAT based branch-and-bound search., и . ICCAD, стр. 852-859. ACM, (2006)Two-Dimensional acking For Irregular Shaped Objects., , , и . HICSS, стр. 86. IEEE Computer Society, (2003)Equivalent Formulations of the Oxygen Depletion Problem, Other Implicit Moving Boundary Value Problems, and Implications for Numerical Approximation., , и . SIAM J. Appl. Math., 83 (1): 52-78 (февраля 2023)Considering Circuit Observability Don't Cares in CNF Satisfiability., , и . DATE, стр. 1108-1113. IEEE Computer Society, (2005)Using Genetic Algorithms To Solve The Yard Allocation Problem., , и . GECCO, стр. 1049-1056. Morgan Kaufmann, (2002)Automated Assumption Generation for Compositional Verification., , и . CAV, том 4590 из Lecture Notes in Computer Science, стр. 420-432. Springer, (2007)Extracting Logic Circuit Structure from Conjunctive Normal Form Descriptions., и . VLSI Design, стр. 37-42. IEEE Computer Society, (2007)Heuristics for the exam scheduling problem., и . ICTAI, стр. 172-175. IEEE Computer Society, (2000)