E-LIB Suche - Ergebnisse für: Bennaceur, Hachemi

1

Robot path planning and cooperation

foundations, algorithms and experimentations Studies in computational intelligence ; Volume 772

Koubâa, Anis ; Bennaceur, Hachemi ; Chaari, Imen ; Trigui, Sahar... , [2018]

Exemplar: Zentrale:E02 a inf 760 e/558

2

Design and performance analysis of global path planning tec..:

Chaari, Imen ; Koubaa, Anis ; Bennaceur, Hachemi...
International Journal of Advanced Robotic Systems. 14 (2017) 2 - p. 172988141666366 , 2017

Link: https://doi.org/10.1177/..

3

Move and Improve: a Market-Based Mechanism for the Multiple..:

Koubâa, Anis ; Cheikhrouhou, Omar ; Bennaceur, Hachemi...
Journal of Intelligent & Robotic Systems. 85 (2016) 2 - p. 307-330 , 2016

Link: https://doi.org/10.1007/..

4

Relaxed Dijkstra and A* with linear complexity for robot pa..:

Ammar, Adel ; Bennaceur, Hachemi ; Châari, Imen..
Soft Computing. 20 (2015) 10 - p. 4149-4171 , 2015

Link: https://doi.org/10.1007/..

5

On the Adequacy of Tabu Search for Global Robot Path Planni..:

Châari, Imen ; Koubâa, Anis ; Bennaceur, Hachemi...
Procedia Computer Science. 32 (2014) - p. 604-613 , 2014

Link: https://doi.org/10.1016/..

6

A Distributed Market-based Algorithm for the Multi-robot As..:

Trigui, Sahar ; Koubaa, Anis ; Cheikhrouhou, Omar...
Procedia Computer Science. 32 (2014) - p. 1108-1114 , 2014

Link: https://doi.org/10.1016/..

7

SmartPATH: An Efficient Hybrid ACO-GA Algorithm for Solving..:

Châari, Imen ; Koubâa, Anis ; Trigui, Sahar...
International Journal of Advanced Robotic Systems. 11 (2014) 7 - p. 94 , 2014

Link: https://doi.org/10.5772/..

8

Clique inference process for solving Max-CSP:

Idir Khemmoudj, Mohand Ou ; Bennaceur, Hachemi
European Journal of Operational Research. 199 (2009) 3 - p. 665-673 , 2009

Link: https://doi.org/10.1016/..

9

Consistency problems in ER-schemas for database systems:

Boufares, Faouzi ; Bennaceur, Hachemi
Information Sciences. 163 (2004) 4 - p. 263-274 , 2004

Link: https://doi.org/10.1016/..

10

A Comparison between SAT and CSP Techniques:

Bennaceur, Hachemi
Constraints. 9 (2004) 2 - p. 123-138 , 2004

Link: https://doi.org/10.1023/..

11

An exact algorithm for the constraint satisfaction problem:..:

Bennaceur, Hachemi ; Plateau, Gérard
Information Processing Letters. 48 (1993) 3 - p. 151-158 , 1993

Link: https://doi.org/10.1016/..

12

Design and performance analysis of global path planning tec..:

Chaari, Imen ; Koubâa, Anis ; Bennaceur, Hachemi...
International Journal of Advanced Robotic Systems;Vol. 14, Issue 2. , 2017

Link: http://hdl.handle.net/10..

13

smartPATH: A hybrid ACO-GA algorithm for robot path plannin:

Chaari, Imen ; Koubaa, Anis ; Bennaceur, Hachemi..
https://zenodo.org/record/1266071. , 2012

Link: https://zenodo.org/recor..

14

Une technique de décomposition pour Max-CSP:

Bennaceur, Hachémi ; Lecoutre, Christophe ; Roussel, Olivier
inria-00291628. , 2008

Link: https://hal.inria.fr/inr..

15

Formulations linéaires pour la programmation par contrainte:

Khemmoudj, Mohand Ou Idir ; Bennaceur, Hachémi
inria-00291553. , 2008

Link: https://inria.hal.scienc..