I. Hafidi

Metaheuristic Approaches for the Satisfiability Problem (SAT): A Systematic Review and Comparative Study with Modern SAT Solvers

The Boolean Satisfiability Problem is a central challenge in artificial intelligence and combinatorial optimization, with applications in circuit verification, planning, and bioinformatics. This study makes two main contributions: a systematic review of metaheuristic approaches conducted under the Preferred Reporting I...

Optimizing Semantic Blocking in Entity Resolution via Autoencoder-Based Deep Clustering

Deep Neural Network Compression via Data-Driven Low-Rank Singular Value Decomposition

This paper proposes a novel compression method that uses Singular Value Decomposition (SVD) informed by data examples that achieves substantial reductions in model size and computation with minimal impact on accuracy and demonstrates its applicability in compressing deep neural networks to a fraction of their original...