Search academic resources

At any time humans need accurate information to solve different problems. For example, how to perform a task, what happens in the news, what the hundreds of tweets say, etc. On the other hand, electronic information has ...

This thesis, entitled €High Performance Computing for solving large sparse systems. Optical Diffraction Tomography as a case of study€ investigates the computational issues related to the resolution of linear systems o...

Digital technologies have revolutionized studying, analyzing, and interpreting human culture, history, and society. Digital humanities (DH) combine traditional disciplines such as literature, history, and philosophy with...

"The steel industry faces increasing challenges in managing product diversity, maintaining competitiveness, and improving operational efficiency. Within this context, recommendation systems present a promising opportunit...

Metaheuristics are used as very good optimization methods and they imitate natural, biologic, social and cultural process. In this work, we evaluate and compare three different metaheuristics which are population-based: ...

Early applications of Ant Colony Optimization (ACO) have been mainly concerned with solving ordering problems (e.g., the Traveling Salesperson Problem). More recently, promising results were obtained for solving the Mult...

The resolution of optimization problems is of great interest nowadays and has encouraged the development of various information technology methods to attempt solving them. There are several problems related to Software E...

A program for the interactive design of elliptic approximation functions on personal computers 1s presented. The use of non-classical el1iptic functions and arithmetic-geometric iterations results in a substantial reduct...

Recently, novel learning algorithms such as Support Vector Regression (SVR) and Neural Networks (NN) have received increasing attention in forecasting and time series prediction, offering attractive theoretical propertie...

En este trabajo se propone una metodología para mejorar las predicciones de incendios forestales. Utilizando un simulador ya desarrollado, se utiliza un algoritmo genético para realizar una búsqueda efectiva de parám...

Public key cryptography has been contributed some important functionality to computer systems security. Each pubic key scheme is based in some mathematics or computational problem, easy to solve in one way (an intended r...

Quantum phenomena exhibit a variety of weird, counter intuitive, puzzling, mysterious and even entertaining effects. Quantum information processing tries to make an effective use of these phenomena to design new quantum ...

The flow shop scheduling problem (FSSP) has held the attention of many researchers. In a simplest usual situation, a set of jobs must follow the same route to be executed on a set of machines (resources) and the main obj...

Interesting real world combinatorial problems are NP-complete and many of them are hard to solve by using traditional methods. However, several heuristic methods have been developed in order to obtain timely suboptimal s...

The growing processing power of standard workstations, along with the relatively easy way in which they can be available for parallel processing, have both contributed to their increasing use in computation intensive app...

One of the most common patterns of the geographic landscape is the fractal or nearfractal form. Unfortunately, most traditional methods of spatial interpolation assume some type of continuous and regionalizeable variatio...

Numerical Taxonomy aims to group in clusters, using so-called structure analysis of operational taxonomic units (OTUs or taxons or taxa) through numerical methods. These clusters constitute families. Structural analysis...

Numerical Taxonomy aims to group in clusters, using so-called structure analysis of operational taxonomic units (OTUs or taxons or taxa) through numerical methods. Clusters that consitute families was the purpose of this...

Globally optimal pseudo-triangulations are di cult to be found by deterministic methods as, for most type of criteria, no polynomial algorithm is known. In this work, we consider the Minimum Weight Pseudo-Triangulation (...

It is known that the Minimum Weight Triangulation problem is NP-hard. Also the complexity of Minimum Weight Pseudo-Triangulation problem is unknown, suspecting that it is also a NP-hard problem. Therefore we focused on ...

Muchos problemas de optimización en configuraciones geométricas son NP-duros por lo que interesa obtener soluciones aproximadas. En este trabajo proponemos la utilización de una técnica metaheurística, Optimizació...

El desarrollo de sistemas de software confiables exige la utilización de herramientas que posibiliten razonar rigurosamente acerca de su corrección y consistencia. Este tipo de análisis revela su importancia crítica ...

The Open Shop Scheduling Problem (OSSP) is one of the most interesting, complexes and not frequently approached scheduling problems. Due to its intractability with other techniques, in this work we present an evolutionar...

This paper presents a basic and an extended heuristic to distribute operating system (OS) services over mobile ad hoc networks. The heuristics are inspired by the foraging behavior of ants and are used within our NanoOS...