Entity

Time filter

Source Type

Boumahra Ahmed, Algeria

Iabbassen D.,University of Science and Technology Houari Boumediene | Iabbassen D.,University of Algiers 3 | Moussaoui S.,University of Science and Technology Houari Boumediene
Communications in Computer and Information Science | Year: 2012

Recently, Mobile Agents have been used for efficient data dissemination in wireless sensor networks. In the traditional Client/Server architectures, data sources are transferred to a destination while in Mobile Agents architectures, a specific executable code passes through relevant sources to collect data. Mobile Agents can be used to significantly reduce the cost of communication, especially through low bandwidth, by moving the processing function to the data, rather that bringing the data to a central processor. This work proposes to use a Client/Server approach using Mobile Agents to aggregate data in a planar architecture of wireless sensor network. © Springer-Verlag Berlin Heidelberg 2012. Source


Amrouche K.,University of Algiers 3 | Amrouche K.,University of Science and Technology Houari Boumediene | Boudhar M.,University of Science and Technology Houari Boumediene
RAIRO - Operations Research | Year: 2016

This paper considers a reentrant flow shop with two machines and exact time lag L, in which each task may be processed in this order M1, M2, M1 and there is an identical time lag between the completion time of the first operation and the start time of the second operation on the first machine. The objective is to minimize the total completion time. We prove the NP-hardness of a special case and we give some special subproblems that can be solved in polynomial time. © 2016 EDP Sciences, ROADEF, SMAI. Source


Gueham A.,University of Algiers 3 | Gueham A.,University of Science and Technology Houari Boumediene | Nagih A.,University of Lorraine | Ait Haddadene H.,University of Science and Technology Houari Boumediene
Proceedings - 2014 International Conference on Control, Decision and Information Technologies, CoDIT 2014 | Year: 2014

In this paper, we focus on the coloration approach and estimation of chromatic number. We propose an upper bound of a chromatic number based on the orientation algorithm described in [4]. This upper bound is improved by developing a novel coloration algorithm. Finally, we make a theoretical and empirical comparison of our bounds with Brooks's bound and Reed's conjecture [15] for class of triangle-free graphs. © 2014 IEEE. Source


Amrouche K.,University of Algiers 3 | Amrouche K.,University of Science and Technology Houari Boumediene | Boudhar M.,University of Science and Technology Houari Boumediene | Bendraouche M.,University of Science and Technology Houari Boumediene | Yalaoui F.,University of Technology of Troyes
International Journal of Production Research | Year: 2016

The two-machine chain-reentrant shop scheduling with the objective of minimizing the makespan, assumes that the tasks pass from the first machine to the second and return back to the first machine. In this paper, we consider the same problem in which an exact time lag between the two operations on the first machine is imposed. In Amrouche and Boudhar (2016) the authors proved that this problem is NP-hard in the strong sense in the case of identical time lags (Formula presented.). We propose heuristic algorithms with empirical results for the latter. In addition, we establish a new NP-hardness result and some polynomial cases. © 2016 Informa UK Limited, trading as Taylor & Francis Group Source


Berreziga A.,Superior Business School | Boukrouh B.,University of Algiers 3
Defect and Diffusion Forum | Year: 2016

There are many forms of alternative energy, such as: the biomass energy, geothermal energy, hydraulic energy, wind power and solar energy. Each form has its natural characteristics and its own exploitation conditions. Thus, the choice of the best resource does not only depend on the provided energy capacity but also on other criteria. In order to select the energy to develop, our survey recommends the multi-criteria method for the best selection. © 2016 Trans Tech Publications, Switzerland. Source

Discover hidden collaborations