- Variable Neighbourhood Search para Maximum Diversity Problem, Course essay, 2008
English title: Variable Neighbourhood Search for Maximum Diversity Problem
English summary: The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the diversity of their characteristics, calculated by a function applied on their attributes. This problem belongs to the class of NP-hard problems [CC Kuo, F Glover, KS Dhir - Decision Sciences, 2007]. In this report, we will apply the metaheuristic called "Variable Neightbourhood Search" to this problem and analyze the results.
- Traza de programas en ambientes colaborativos de aprendizaje en computación móvil, Bachelor Thesis, 2008
English title: Tracing applications on collaborative learning environments with mobile computing
English summary: This is a project with two applications: one for Windows Mobile 6 and another for Windows (built with .NET Compact Framework). Students in a class have a PDA and the teacher send to them a XML file that represent the code, variables and trace of a application. The PDA receives the XML file and allows to the students to debug a application as if this one was running in the PDA. All students can debug the application as a collaborative debugger and they can send messages and draw in a collaborative whiteboard.
- Metaheurísticas aplicadas a problemas de ordenación lineal sobre grafos, Master Thesis, 2008
English title: Metaheuristics applied for graph layout problems
English summary: Graph layout problems are a particular class of combinatorial optimization problems whose goal is to find a linear layout of an input graph in such way that a certain objective cost is optimized. A linear layout is a labeling of the nodes of a graph with distinct integers. A large amount of relevant problems in different areas can be formulated as graph layout problems. These include network optimization, VLSI circuit design, information retrieval, numerical analysis, computational biology, graph theory, scheduling, archaeology,etc. [J Diaz - Mathematical Foundations of Computer Science 1992]. In this master thesis, we will study and apply several metaheuristics in order to optimize this problem.
- Security for Mobile Agents and Platforms, Course essay, 2010
Abstract: In this report, we present an overview in the security of the mobile agents and platforms. The recent necessity of mobile agents grow up with the global intercommunication. Mobiles phones, PDA (Personal Digital Assistant), e-Readers and the apparition of thousands of small devices which are introducing in the social life make that the mobile agent parading and their security get turn in an important case of study. During this report, we will build an overview of the mobile agent story, security research and an analysis about advantages and disadvantages of methods used nowadays.
