@article {9467097620130101,
	title = {Efficient Heuristic Based on Clustering Approach for OLSR.},
	journal = {Journal of Computer Networks \& Communications},
	year = {2013},
	pages = {1 - 7},
	abstract = {Due to the dynamic nature of mobile ad hoc network (MANET), the quality of service (QoS) requires several improvements. The present paper comes within the framework of research to optimize QoS in MANET. In this paper, we propose a novel version of OLSR based on the clustering approach which is inspired from Lin and Chu heuristic and adapted to be implemented in OLSR. We studied its stability and we compared its performances to those of standard OLSR. The metrics we used in evaluating network performances were average end-to-end delay, control routing overhead, and packet delivery ratio. Experimental results show that our alternative significantly reduces the traffic reserved to monitoring the network, which positively influences other performances such as throughput, delay, and loss. [ABSTRACT FROM AUTHOR]},
	keywords = {Ad hoc networks (Computer networks), Document clustering, Heuristic algorithms, Internet traffic, Performance evaluation, Quality of service, Routing (Computer network management)},
	issn = {20907141},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=iih\&AN=94670976\&site=ehost-live},
	author = {Choukri, Ali and Habbani, Ahmed and Koutbi, Mohamed El.}
}
@article {8699110620120101,
	title = {Efficient Dual Domain Decoding of Linear Block Codes Using Genetic Algorithms.},
	journal = {Journal of Electrical \& Computer Engineering},
	year = {2012},
	pages = {1 - 12},
	abstract = {A computationally efficient algorithm for decoding block codes is developed using a genetic algorithm (GA). The proposed algorithm uses the dual code in contrast to the existing genetic decoders in the literature that use the code itself. Hence, this new approach reduces the complexity of decoding the codes of high rates. We simulated our algorithm in various transmission channels. The performance of this algorithm is investigated and compared with competitor decoding algorithms including Maini and Shakeel ones. The results show that the proposed algorithm gives large gains over the Chase-2 decoding algorithm and reach the performance of the OSD-3 for some quadratic residue (QR) codes. Further, we define a new crossover operator that exploits the domain specific information and compare it with uniform and two point crossover. The complexity of this algorithm is also discussed and compared to other algorithms [ABSTRACT FROM AUTHOR]},
	keywords = {Coding theory, Computational complexity, Data transmission systems, Decoders (Electronics) {\textendash} Software, Genetic algorithms, Performance evaluation},
	issn = {20900147},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=iih\&AN=86991106\&site=ehost-live},
	author = {Azouaoui, Ahmed and Belkasmi, Mostafa and Farchane, Abderrazak}
}
@article {8699111820120101,
	title = {Reduced Complexity Iterative Decoding of 3D-Product Block Codes Based on Genetic Algorithms.},
	journal = {Journal of Electrical \& Computer Engineering},
	year = {2012},
	pages = {1 - 8},
	abstract = {Two iterative decoding algorithms of 3D-product block codes (3D-PBC) based on genetic algorithms (GAs) are presented. The first algorithm uses the Chase-Pyndiah SISO, and the second one uses the list-based SISO decoding algorithm (LBDA) based on order-i reprocessing. We applied these algorithms over AWGN channel to symmetric 3D-PBC constructed from BCH codes. The simulation results show that the first algorithm outperforms the Chase-Pyndiah one and is only 1.38 dB away from the Shannon capacity limit at BER of 10-5 for BCH (31, 21, 5){\textthreesuperior} and 1.4 dB for BCH (16, 11, 4){\textthreesuperior}. The simulations of the LBDA-based GA on the BCH (16, 11, 4){\textthreesuperior} show that its performances outperform the first algorithm and is about 1.33 dB from the Shannon limit. Furthermore, these algorithms can be applied to any arbitrary 3D binary product block codes, without the need of a hard-in hardout decoder. We show also that the two proposed decoders are less complex than both Chase-Pyndiah algorithm for codes with large corr},
	keywords = {Computational complexity, Computer simulation, Genetic algorithms, Iterative decoding, Performance evaluation, Three-dimensional imaging},
	issn = {20900147},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=iih\&AN=86991118\&site=ehost-live},
	author = {Ahmadi, Abdeslam and Bouanani, Faissal El and Ben-Azza, Hussain and Benghabrit, Youssef}
}
@article {5570174020110101,
	title = {Approximate performance analysis of CONWIP disciplines in unreliable non homogeneous transfer lines.},
	journal = {Annals of Operations Research},
	volume = {182},
	number = {1},
	year = {2011},
	pages = {213 - 233},
	abstract = {For a given choice of the maximum allowable total storage parameter, the performance of constant work-in-process (CONWIP) disciplines in unreliable transfer lines subjected to a constant rate of demand for parts, is characterized via a tractable approximate mathematical model. For a ( n?1) machines CONWIP loop, the model consists of n multi-state machine single buffer building blocks, separately solvable once a total of ( n?1) unknown constants shared by the building blocks are initialized. The multi-state machine is common to all building blocks, and its n discrete states approximate the joint operating state of the machines within the CONWIP loop; each of the first ( n?1) blocks maps into a single internal buffer dynamics, while the nth building block characterizes total work-in-process (wip) dynamics. The blocks correspond to linear n component state equations with boundary conditions. The unknown (shared) constants in the block dynamics are initialized and calculated by means of s},
	keywords = {Aggregation operators, CONWIP, Decomposition method (Mathematics), Decomposition/aggregation methods, Forward Kolmogorov equations, Mathematical models, Monte Carlo method, Operations research, Performance evaluation, Reliability (Engineering)},
	issn = {02545330},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=iih\&AN=55701740\&site=ehost-live},
	author = {Mhada, Fatima and Malhame, Roland}
}
