default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHachemi Bennaceur
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[b1]Anis Koubaa, Hachemi Bennaceur, Imen Châari, Sahar Trigui, Adel Ammar, Mohamed-Foued Sriti, Maram Alajlan, Omar Cheikhrouhou, Yasir Javed:
Robot Path Planning and Cooperation - Foundations, Algorithms and Experimentations. Studies in Computational Intelligence 772, Springer 2018, ISBN 978-3-319-77040-6, pp. 3-188- 2017
- [j9]Hachemi Bennaceur, Zakir Ahmed:
Frequency model based crossover operators for genetic algorithms applied to the quadratic assignment problem. Int. Arab J. Inf. Technol. 14(1): 138-145 (2017) - [j8]Anis Koubâa
, Omar Cheikhrouhou, Hachemi Bennaceur, Mohamed-Foued Sriti, Yasir Javed, Adel Ammar:
Move and Improve: a Market-Based Mechanism for the Multiple Depot Multiple Travelling Salesmen Problem. J. Intell. Robotic Syst. 85(2): 307-330 (2017) - 2016
- [j7]Maram Alajlan, Imen Châari, Anis Koubaa, Hachemi Bennaceur, Adel Ammar, Habib Youssef:
Global robot Path Planning using GA for Large Grid Maps: Modelling, Performance and Experimentation. Int. J. Robotics Autom. 31(6) (2016) - [j6]Adel Ammar, Hachemi Bennaceur, Imen Châari, Anis Koubâa, Maram Alajlan:
Relaxed Dijkstra and A* with linear complexity for robot path planning problems in large-scale grid environments. Soft Comput. 20(10): 4149-4171 (2016) - [c22]Sarah Alnasser, Hachemi Bennaceur:
An efficient Genetic Algorithm for the global robot path planning problem. DICTAP 2016: 97-102 - [c21]Hanan Alsouly, Hachemi Bennaceur:
Enhanced Genetic Algorithm for Mobile Robot Path Planning in Static and Dynamic Environment. IJCCI (ECTA) 2016: 121-131 - 2015
- [p1]Anis Koubâa, Mohamed-Foued Sriti, Hachemi Bennaceur, Adel Ammar, Yasir Javed, Maram Alajlan, Nada Al-Elaiwi, Mohamed Tounsi, Elhadi M. Shakshuki:
COROS: A Multi-Agent Software Architecture for Cooperative and Autonomous Service Robots. Advances in Social Media Analysis 2015: 3-30 - 2014
- [c20]Imen Châari, Anis Koubâa, Hachemi Bennaceur, Adel Ammar, Sahar Trigui, Mohamed Tounsi, Elhadi M. Shakshuki, Habib Youssef:
On the Adequacy of Tabu Search for Global Robot Path Planning Problem in Grid Environments. ANT/SEIT 2014: 604-613 - [c19]Sahar Trigui, Anis Koubâa, Omar Cheikhrouhou, Habib Youssef, Hachemi Bennaceur, Mohamed-Foued Sriti, Yasir Javed:
A Distributed Market-based Algorithm for the Multi-robot Assignment Problem. ANT/SEIT 2014: 1108-1114 - [c18]Omar Cheikhrouhou, Anis Koubaa, Hachemi Bennaceur:
Move and improve: A distributed multi-robot coordination approach for multiple depots multiple travelling salesmen problem. ICARSC 2014: 28-35 - 2012
- [c17]Imen Châari, Anis Koubaa, Hachemi Bennaceur, Sahar Trigui, Khaled Al-Shalfan:
smartPATH: A hybrid ACO-GA algorithm for robot path planning. IEEE Congress on Evolutionary Computation 2012: 1-8
2000 – 2009
- 2009
- [j5]Mohand Ou Idir Khemmoudj, Hachemi Bennaceur:
Clique inference process for solving Max-CSP. Eur. J. Oper. Res. 199(3): 665-673 (2009) - 2008
- [c16]Hachemi Bennaceur, Christophe Lecoutre, Olivier Roussel:
A Decomposition Technique for Max-CSP. ECAI 2008: 500-504 - 2007
- [c15]Mohand Ou Idir Khemmoudj, Hachemi Bennaceur:
Valid Inequality Based Lower Bounds for WCSP. CP 2007: 394-408 - 2006
- [c14]Mohand Ou Idir Khemmoudj, Marc Porcheron, Hachemi Bennaceur:
When Constraint Programming and Local Search Solve the Scheduling Problem of Electricité de France Nuclear Power Plant Outages. CP 2006: 271-283 - [c13]Mohand Ou Idir Khemmoudj, Hachemi Bennaceur:
Clique Inference Process for Solving Max-CSP. CP 2006: 746-750 - 2005
- [c12]Mohand Ou Idir Khemmoudj, Hachemi Bennaceur, Anass Nagih:
Combining Arc-Consistency and Dual Lagrangean Relaxation for Filtering CSPs. CPAIOR 2005: 258-272 - 2004
- [j4]Hachemi Bennaceur:
A Comparison between SAT and CSP Techniques. Constraints An Int. J. 9(2): 123-138 (2004) - [j3]Faouzi Boufarès, Hachemi Bennaceur:
Consistency problems in ER-schemas for database systems. Inf. Sci. 163(4): 263-274 (2004) - 2003
- [c11]Hachemi Bennaceur, Aomar Osmani:
Computing Lower Bound for MAX-CSP Problems. IEA/AIE 2003: 614-624 - [c10]Faouzi Boufarès, Hachemi Bennaceur, Aomar Osmani:
On the consistency of cardinality constraints in UML modelling. CE 2003: 287-292 - 2002
- [c9]Hachemi Bennaceur, Chu Min Li:
Characterizing SAT Problems with the Row Convexity Property. CP 2002: 720-725 - 2001
- [c8]Hachemi Bennaceur, Mohamed-Salah Affane:
Partition-k-AC: An Efficient Filtering Technique Combining Domain Partition and Arc Consistency. CP 2001: 560-564
1990 – 1999
- 1998
- [j2]Hachemi Bennaceur, Idir Gouachi, Gérard Plateau:
An Incremental Branch-and-Bound Method for the Satisfiability Problem. INFORMS J. Comput. 10(3): 301-308 (1998) - [c7]Mohamed-Salah Affane, Hachemi Bennaceur:
A Weighted Arc Consistency Technique for MAX-CSP. ECAI 1998: 209-213 - 1996
- [c6]Mohamed-Salah Affane, Hachemi Bennaceur:
A Labelling Arc Consistency Method for Functional Constraints. CP 1996: 16-30 - [c5]Hachemi Bennaceur:
The Satisfiability Problem Regarded as a Constraint Satisfaction Problem. ECAI 1996: 155-159 - [c4]Amar Isli, Hachemi Bennaceur:
Networks of Qualitative Interval Relations: Combining Circuit Consistency and Path Consistency in the Search for a Solution. TIME 1996: 57-62 - 1995
- [c3]Hachemi Bennaceur:
Boolean approch for representing and solving constraint-satisfaction problems. AI*IA 1995: 163-174 - 1994
- [c2]Hachemi Bennaceur:
Partial Consistency for Constraint-Satisfaction Problems. ECAI 1994: 120-124 - 1993
- [j1]Hachemi Bennaceur, Gérard Plateau:
An Exact Algorithm for the Constraint Satisfaction Problem: Application to Logical Inference. Inf. Process. Lett. 48(3): 151-158 (1993) - 1991
- [c1]Hachemi Bennaceur, Gérard Plateau:
Theorem Proving by Combinatorial Optimization. IWWERT 1991: 90-102
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
