Newcastle.pptVIP

... And more thesis’ conclusions... Possibility of establishing a solid computational complexity theory of recombination problems Classes uPMA and PMA. Computational complexity of multi-parent recombination (... Links to genetic engineering issues ?). Benefits of using methods from Modal Logic and Multi-Agent Belief Logic for the introduction of problem (and instance) dependent knowledge. Possibility of using the generated “on-line” knowledge to guide exact and GRASP-like algorithms by taking advantage of the learning processes in each agent. Use of Logic Programming and belief update methods to update the population’s shared knowledge.. Synergies with CS at Newcastle Possibility of establishing several interactions with many members of the Faculty A Memetic Algorithm Guided by Quicksort for the Error-Correcting Graph Isomorphism Problem R. Torres-Velázques and V. Estivill-Castro from the Knowledge Discovery and Data Mining Lab Subjects of synergies may be: Evolutionary Computation, (… and of course MAs) Applications of KDD techniques in Bioinformatics (clustering, subgraph isomorphism, exploratory data analysis of massive data sets, data mining, classification and clustering, etc.) Synergies with CS at Newcastle ”System identification is a field where one tries to intelligently determine a mathematical model for the global behaviour of a system on the basis of observing its response around a local operating point for a fixed period of time.” ... from a web page at ..au Genetic network inference problems from microarray data are pretty much a system idenfication problem !! Here the synergy may be on establishing a common framework of techniques applied in Control and System Theory and in conjunction with algorithms more akin to CS research (i.e. based on Graph Theory and Graph Optimization methods). AI + KDD + SI techniques + Graph Theory and Graph Optimization - as a systematic integrated approach to treat problems