دنبال کردن
Mohamed Nadeem
عنوان
نقل شده توسط
نقل شده توسط
سال
Plausibility Reasoning via Projected Answer Set Counting-A Hybrid Approach.
JK Fichte, M Hecher, MA Nadeem, TU Dresden
IJCAI 22, 2620-2626, 2022
152022
Polynomial formal verification exploiting constant cutwidth
M Nadeem, J Kleinekathofer, R Drechsler
Proceedings of the 34th International Workshop on Rapid System Prototyping, 1-7, 2023
42023
Polynomial Formal Verification of Adder Circuits Using Answer Set Programming
M Nadeem, J Kleinekathöfer, R Drechsler
42023
Polynomial formal verification of approximate adders with constant cutwidth
M Nadeem, CK Jha, R Drechsler
2024 IEEE European Test Symposium (ETS), 1-6, 2024
32024
Polynomial Formal Verification of Multi-Valued Logic Circuits within Constant Cutwidth Architectures
M Nadeem, R Drechsler
2024 IEEE 54th International Symposium on Multiple-Valued Logic (ISMVL), 149-154, 2024
12024
Polynomial Formal Verification of Multi-Valued Approximate Circuits Within Constant Cutwidth
M Nadeem, CK Jha, R Drechsler
IEEE Transactions on Circuits and Systems I: Regular Papers, 2025
2025
A Polynomial Approach for finding Most Specific Concept wrt General EL-TBoxes
MAAL Nadeem
2022
Polynomial Formal Verification of Sequential Circuits using Weighted-AIGs
M Nadeem, CK Jha, R Drechsler
2024 IEEE 54th International Symposium on Multiple-Valued Logic (ISMVL)| 979-8-3503-4308-3/24/$31.00© 2024 IEEE| DOI: 10.1109/ISMVL60454. 2024.00042
E Aichinger, D Amaro Alcalá, K Asano, JT Astola, M Behrisch, BA Talib, ...
سیستم در حال حاضر قادر به انجام عملکرد نیست. بعداً دوباره امتحان کنید.
مقاله‌ها 1–9