AUTHORS: Alberto Arteta, Luis F. Mingo, Juan Castellanos

Download as PDF

ABSTRACT: During years proper memory utilization has been the differential factor for algorithms that try to solve complex problems in optimal time. Computational complexity is currently measured in time and space. The way that algorithms are built can make a huge difference when obtaining desired solutions to problems. Memory engineering based algorithms reveal themselves as essential when fast results are needed and offer unlimited options to improve whatever bioinspired algorithm that based its performance in terms of time and space. This work focuses on creating a mathematical generic strategy by building structures through the use of an isomorphism that optimize the memory utilization and the resolution time of bioinspired models when dealing with high computational problems. Therefore offers a great help when solving complex and known issues

KEYWORDS: Bioinspired models, General Optimization , Complex problems resolution

REFERENCES:

[1] Nidhal kamel taha el-omari “Scanned document image segmentation using back-propagation artificial neural network based technique” North Atlantic University Union (NAUN) International journal of computers and communications issue 3, volume 6, 2012

[2] Enhancing Parallel Recursive Brute Force Algorithm for Motif Finding , 103 Marwa Radad recent advances in computer science proceedings of the 6th wseas world congress: applied computing conference (acc '13) 103-11

[3] Dimitar ivanov, univis – “A 3d software system visualization using natural metaphors” pages: 107-119 International Journal of computers Issn:1998-4308 volume 8, 2014 North Atlantic University Union (NAUN)

[4] Gh. Păun, “Computing with Membranes”, Journal of Computer and System Sciences, 61(2000), and Turku Center of Computer Science-TUCS Report nº 208, 1998.

[5] Gh. Păun, “Membrane computing. Basic ideas results, applications”, PreProceedings of First International Workshop on Theory and Application of P Systems, Timisoara (Romania), pp. 1- 8, September , 2005.

[6] Kenneth Price, Rainer M. Storn, and Jouni A. Lampinen. Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series). Springer- Verlag New York, Inc., 2005.ISBN 3540209506..

[7] K.V. Price. Differential evolution: a fast and simple numerical optimizer. In Fuzzy Information Processing Society, 1996. NAFIPS. 1996 Biennial Conference of the North American, pages 524– 527, 1996. doi: {10.1109/NAFIPS.1996.534790}.

[8] Lingian Pan, Carlos Martin-Vide ''Solving multidimensional 0-1 knapsack problem by P systems with input and active membranes'', Journal of Parallel and Distributed Computing Volume 65 , Issue 12 (December 2005)

[9] Lin, Shen, Kernigham BW An Effective Heuristic Algorithm for the TravelingSalesman Problem'. Operations Research 21 (2): 498–516. doi:10.1287/opre.21.2.498.Volume 21, Issue 2, March- April 1973

[10] A. Arteta, L.Fernandez, J.Gil “Algorithm for Application of Evolution Rules based on linear diophantine equations” Synasc 2008.Timisoara Romania September 2008

[11] Arroyo, A. Arteta,, A. Goñi. Calculating maximal multisets using RAM as support, Artificial life and Robotics 2010, Beppu Japan

[12] Alberto Arteta, Nuria Gomez Luis Fernando Mingo. ,Solving complex problems with a bioinspired model. Engineering Applications of Artificial Intelligence,Volume 24, Issue 6, September 2011, Pages 919–927

[13] Alberto Arteta , Angel Castellanos, Ana Martinez: Membrane computing: non deterministic technique to calculate extinguished multisets of objects. International Journal “ Information Technologie s and Knowledge”, Vol. 4, Number 1, 2010

[14] Chiang, Jui-Hao. Optimization Techniques for Memory Virtualizationbased Resource Management Publisher: The Graduate School, Stony Brook University: Stony Brook, NY. Date: 1- Dec-12

[15] Ganon, Jalby Strategies for cache and local memory management by global program transformation Journal of Parallel and Distributed Computing, Volume 5, Issue 5, October 1988, Pages 587–616

[16] L. Fernandez, J.Castellanos, F. Arroyo, J. tejedor, I Garcıa “New algorithm for application of evolution rules”, Proceedings of the 2006 International Conference on Bioinformatics and Computational Biology, BIOCOMP’06, Las Vegas, Nevada, USA, 2006.