publications: - title: "Quantum Genetic Algorithm for Binary Decision Diagram Ordering Problem" author: - name: "Abdesslem Layeb" link: "http://layeb.new.fr" - name: "Djamel-Eddine Saidouni" link: "https://researchr.org/alias/djamel-eddine-saidouni" year: "2007" abstract: "The Binary Decision Diagram (BDD) is used to represent in symbolic manner a set of states. It’s largely used in the field of formal checking. The variable ordering is a very important step in the BDD optimization process. A good order of variables will reduce considerably the size of a BDD. Unfortunately, the search for the best variables ordering has been showed NP-difficult. In this article, we propose a new iterative approach called QGABDD based on a Quantum Genetic Algorithm. QGABDD is based on a basic core defined by a suitable quantum representation and an adapted quantum evolutionary dynamic. The obtained results are encouraging and attest the feasibility and the effectiveness of our approach. QGABDD is distinguished by a reduced population size and a reasonable number of iterations to find the best order, thanks to the principles of quantum computing" tags: - "optimization" - "rule-based" - "principles" - "search" - "systematic-approach" researchr: "https://researchr.org/publication/Layeb07quantumgenetic" cites: 0 citedby: 0 howpublished: "the International Journal of Computer Science and Network Security, Vol.7, No 9, pp. 130-135, ISSN 1738-7906" kind: "misc" key: "Layeb07quantumgenetic" - title: "A New Quantum Scatter Search Algorithm for MAX 3-SAT Problem" author: - name: "Abdesslem Layeb" link: "http://layeb.new.fr" - name: "Djamel-Eddine Saidouni" link: "https://researchr.org/alias/djamel-eddine-saidouni" - name: "El-Ghazali Talbi" link: "https://researchr.org/alias/el-ghazali-talbi" year: "2008" tags: - "search" researchr: "https://researchr.org/publication/cans-0-0" cites: 0 citedby: 0 booktitle: "Complexity in Artificial and Natural Systems" series: "ISSN 2065-0426" publisher: "Petru Maior University Press" kind: "inproceedings" key: "cans-0-0" - title: "A Quantum Evolutionary Algorithm for Effective Multiple Sequence Alignment" author: - name: "Souham Meshoul" link: "https://researchr.org/alias/souham-meshoul" - name: "Abdesslem Layeb" link: "http://layeb.new.fr" - name: "Mohamed Batouche" link: "https://researchr.org/alias/mohamed-batouche" year: "2005" doi: "http://dx.doi.org/10.1007/11595014_26" links: doi: "http://dx.doi.org/10.1007/11595014_26" researchr: "https://researchr.org/publication/MeshoulLB05" cites: 0 citedby: 0 pages: "260-271" booktitle: "Progress in Artificial Intelligence, 12th Portuguese Conference on Artificial Intelligence, EPIA 2005, Covilhã, Portugal, December 5-8, 2005, Proceedings" editor: - name: "Carlos Bento" link: "https://researchr.org/alias/carlos-bento" - name: "Amílcar Cardoso" link: "https://researchr.org/alias/am%C3%ADlcar-cardoso" - name: "Gaël Dias" link: "https://researchr.org/alias/ga%C3%ABl-dias" volume: "3808" series: "Lecture Notes in Computer Science" publisher: "Springer" isbn: "3-540-30737-0" kind: "inproceedings" key: "MeshoulLB05" - title: "Quantum Genetic Algorithm for Multiple RNA Structural Alignment" author: - name: "Abdesslem Layeb" link: "http://layeb.new.fr" - name: "Souham Meshoul" link: "https://researchr.org/alias/souham-meshoul" - name: "Mohamed Batouche" link: "https://researchr.org/alias/mohamed-batouche" year: "2008" doi: "http://doi.ieeecomputersociety.org/10.1109/AMS.2008.151" links: doi: "http://doi.ieeecomputersociety.org/10.1109/AMS.2008.151" researchr: "https://researchr.org/publication/LayebMB08" cites: 0 citedby: 0 pages: "873-878" booktitle: "Second Asia International Conference on Modelling and Simulation (AMS 2008), Kuala Lumpur, Malaysia, 13-15 May, 2008" publisher: "IEEE Computer Society" kind: "inproceedings" key: "LayebMB08" - title: "Quantum Evolutionary Algorithms for Multiple Sequences Alignment" author: - name: "Abdesslem Layeb" link: "http://layeb.new.fr" year: "2005" researchr: "https://researchr.org/publication/matserthes" cites: 0 citedby: 0 school: "Computer Science department, University Mentouri Of Constantine, Algeria" kind: "mastersthesis" key: "matserthes" - title: "Quantum Differential Evolution Algorithm for Variable Ordering Problem of Binary Decision Diagram" author: - name: "Abdesslem Layeb" link: "http://layeb.new.fr" - name: "Djamel-Eddine Saidouni" link: "https://researchr.org/alias/djamel-eddine-saidouni" year: "2008" doi: "http://dx.doi.org/10.1007/978-3-540-89985-3_139" links: doi: "http://dx.doi.org/10.1007/978-3-540-89985-3_139" researchr: "https://researchr.org/publication/ccis2008" cites: 0 citedby: 0 booktitle: "Advances in Computer Science and Engineering" volume: "6" number: "2" series: "Communications in Computer and Information Science" publisher: "springer" kind: "inproceedings" key: "ccis2008" - title: "A QUANTUM GENETIC ALGORITHM WITH HILL CLIMBING ALGORITHM FOR MAX 3-SAT PROBLEMS" author: - name: "Abdesslem Layeb" link: "http://layeb.new.fr" - name: "Djamel-Eddine Saidouni" link: "https://researchr.org/alias/djamel-eddine-saidouni" year: "2008" researchr: "https://researchr.org/publication/jatitlayeb" cites: 0 citedby: 0 journal: "Journal of Theoretical and Applied Information Technology" volume: "4" number: "11" kind: "article" key: "jatitlayeb" - title: "Multiple Sequence Alignment by Immune Artificial System" author: - name: "Abdesslem Layeb" link: "http://layeb.new.fr" - name: "Abdel Hakim Deneche" link: "https://researchr.org/alias/abdel-hakim-deneche" year: "2007" doi: "http://dx.doi.org/10.1109/AICCSA.2007.370903" links: doi: "http://dx.doi.org/10.1109/AICCSA.2007.370903" researchr: "https://researchr.org/publication/LayebD07" cites: 0 citedby: 0 pages: "336-342" booktitle: "2007 IEEE/ACS International Conference on Computer Systems and Applications (AICCSA 2007), 13-16 May 2007, Amman, Jordan" publisher: "IEEE" kind: "inproceedings" key: "LayebD07" - title: "Quantum differential evolution Algorithms Based on Hill Climbing for Solving BDD Ordering Problem" author: - name: "Abdesslem Layeb" link: "http://layeb.new.fr" - name: "Djamel-Eddine Saidouni" link: "https://researchr.org/alias/djamel-eddine-saidouni" year: "2008" tags: - "rule-based" researchr: "https://researchr.org/publication/cans-0" cites: 0 citedby: 0 booktitle: "Complexity in Artificial and Natural Systems" series: "ISSN 2065-0426" publisher: "Petru Maior University Press" kind: "inproceedings" key: "cans-0" - title: "A Hybrid method for effective multiple sequence alignment." author: - name: "Abdesslem Layeb" link: "http://layeb.new.fr" - name: "Souham Meshoul" link: "https://researchr.org/alias/souham-meshoul" - name: "Mohamed Batouche" link: "https://researchr.org/alias/mohamed-batouche" year: "2009" links: "url": "http://dblp.uni-trier.de/db/conf/iscc/iscc2009.html#LayebMB09" researchr: "https://researchr.org/publication/conf-iscc-LayebMB09" cites: 0 citedby: 0 booktitle: "ISCC" publisher: "IEEE" kind: "inproceedings" key: "conf-iscc-LayebMB09" - title: "QEAMSA: a Quantum Evolutionary Algorithm for Multiple Sequence Alignment" author: - name: "Souham Meshoul" link: "https://researchr.org/alias/souham-meshoul" - name: "Abdesslem Layeb" link: "http://layeb.new.fr" - name: "Mohamed Batouche" link: "https://researchr.org/alias/mohamed-batouche" year: "2005" researchr: "https://researchr.org/publication/cans" cites: 0 citedby: 0 kind: "inproceedings" key: "cans" - title: "Multiple sequence alignment by quantum genetic algorithm." author: - name: "Abdesslem Layeb" link: "http://layeb.new.fr" - name: "Souham Meshoul" link: "https://researchr.org/alias/souham-meshoul" - name: "Mohamed Batouche" link: "https://researchr.org/alias/mohamed-batouche" year: "2006" links: "url": "http://dblp.uni-trier.de/db/conf/ipps/ipdps2006.html#AbdesslemSM06" researchr: "https://researchr.org/publication/conf-ipps-AbdesslemSM06" cites: 0 citedby: 0 booktitle: "IPDPS" publisher: "IEEE" kind: "inproceedings" key: "conf-ipps-AbdesslemSM06" - title: "A New Quantum Evolutionary Local Search Algorithm for MAX 3-SAT Problem" author: - name: "Abdesslem Layeb" link: "http://layeb.new.fr" - name: "Djamel-Eddine Saidouni" link: "https://researchr.org/alias/djamel-eddine-saidouni" year: "2008" doi: "http://dx.doi.org/10.1007/978-3-540-87656-4_22" links: doi: "http://dx.doi.org/10.1007/978-3-540-87656-4_22" tags: - "search" researchr: "https://researchr.org/publication/LayebS08" cites: 0 citedby: 0 pages: "172-179" booktitle: "Hybrid Artificial Intelligence Systems, Third International Workshop, HAIS 2008, Burgos, Spain, September 24-26, 2008. Proceedings" editor: - name: "Emilio Corchado" link: "https://researchr.org/alias/emilio-corchado" - name: "Ajith Abraham" link: "https://researchr.org/alias/ajith-abraham" - name: "Witold Pedrycz" link: "https://researchr.org/alias/witold-pedrycz" volume: "5271" series: "Lecture Notes in Computer Science" publisher: "Springer" isbn: "978-3-540-87655-7" kind: "inproceedings" key: "LayebS08" - title: "Using Combinatorial Optimization Approaches for the Verification of Real Time Applications" author: - name: "Abdesslem Layeb" link: "http://layeb.new.fr" year: "2010" abstract: "In this doctoral thesis, we are interested in two big combinatory optimization problems encountered within the formal methods when we check applications. The first problem is the variable reordering for Binary Decision Diagram (BDD). The BDD is used to represent in symbolic manner a set of states. It’s largely used in the field of formal checking. The variable ordering is a very important step in the BDD optimization process. A good order of variables will reduce considerably the size of a BDD. Unfortunately, the search for the best variables ordering has been showed NP-difficult. The second kind of problems handled in this thesis is the satisfiability problems (SAT and MAX-SAT). The Boolean satisfiability problem is defined as the task of determining the satisfiability of a given Boolean formula by looking for the variable assignment that makes this formula evaluating to true. The Maximum Satisfiability (Max-SAT) problem is a variant of SAT problem that aims to find the variable assignment maximizing the number of satisfied clauses. It has been demonstrated that the Max-SAT problem is NP-complete. This complex problem has several applications in different domains such as model checking, graph coloring and task planning, etc. The use of heuristics like genetic algorithms and local search is essential to find acceptable solutions within reasonable times. Within this perspective, we are interested in applying hybrid evolutionary algorithms to solve these problems. Key words: binary decision diagram, SAT, MAX-SAT, optimization, quantum evolutionary algorithms, local research, exact approaches, hybrid approaches. " tags: - "optimization" - "completeness" - "model checking" - "meta-model" - "graph-rewriting" - "Meta-Environment" - "rewriting" - "search" - "process modeling" - "systematic-approach" researchr: "https://researchr.org/publication/thesformel" cites: 0 citedby: 0 school: "Computer Science department, University Mentouri Of Constantine, Algeria" kind: "phdthesis" key: "thesformel"