Kamal Amroun

Orcid: 0000-0002-4259-2783

According to our database1, Kamal Amroun authored at least 19 papers between 2009 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A novel multi-level hybrid load balancing and tasks scheduling algorithm for cloud computing environment.
J. Supercomput., June, 2024

A novel privacy-aware global infrastructure for ecological footprint calculator based on the Internet of things and blockchain.
J. Supercomput., May, 2024

2023
HSJ-Solver: a new method based on GHD for answering conjunctive queries and solving constraint satisfaction problems.
Appl. Intell., July, 2023

An efficient heuristic approach combining maximal itemsets and area measure for compressing voluminous table constraints.
J. Supercomput., 2023

Parallel FPTCM<sup>+</sup>: Parallel FP-Tree Based Compression Method for Large Datasets.
Proceedings of the Advances in Information and Communication, 2023

2022
A novel epsilon-dominance Harris Hawks optimizer for multi-objective optimization in engineering design problems.
Neural Comput. Appl., 2022

A new wrapper feature selection model for anomaly-based intrusion detection systems.
Int. J. Secur. Networks, 2022

2021
Robust multimodal biometric authentication on IoT device through ear shape and arm gesture.
Multim. Tools Appl., 2021

An efficient biometric-based continuous authentication scheme with HMM prehensile movements modeling.
J. Inf. Secur. Appl., 2021

2020
New Wrapper Feature Selection Algorithm for Anomaly-Based Intrusion Detection Systems.
Proceedings of the Foundations and Practice of Security - 13th International Symposium, 2020

Exploitation des techniques de fouille de données pour la compression de contraintes table.
Proceedings of the Extraction et Gestion des Connaissances, 2020

2019
Exploiting Data Mining Techniques for Compressing Table Constraints.
Proceedings of the 31st IEEE International Conference on Tools with Artificial Intelligence, 2019

2016
Generalized Hypertree Decomposition for solving non binary CSP with compressed table constraints.
RAIRO Oper. Res., 2016

A compressed Generalized Hypertree Decomposition-based solving technique for non-binary Constraint Satisfaction Problems.
AI Commun., 2016

2015
A Forward-Checking algorithm based on a Generalised Hypertree Decomposition for solving non-binary constraint satisfaction problems.
J. Exp. Theor. Artif. Intell., 2015

Novel method for dynamic web service selection and composition using hypergraph decomposition.
Proceedings of the IPAC '15: International Conference on Intelligent Information Processing, 2015

2011
Solving Non Binary Constraint Satisfaction Problems with Dual Backtracking on Hypertree Decomposition.
Proceedings of the ICAART 2011 - Proceedings of the 3rd International Conference on Agents and Artificial Intelligence, Volume 1, 2011

2009
Hypertree Decomposition for Solving Constraint Satisfaction Problems.
Proceedings of the ICAART 2009 - Proceedings of the International Conference on Agents and Artificial Intelligence, Porto, Portugal, January 19, 2009

Solving Hypertree Structured CSP: Sequential and Parallel Approaches.
Proceedings of the 16th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, 2009


  Loading...