Search academic resources

We present an evolutionary algorithm that evolves a population of local approximators in order to fit an unknown function. The evolutionary algorithm performs a simultaneous learning of simple local approximators togethe...

Approximation algorithms for a class of planar graph problems, including planar independent set, planar vertex cover and planar dominating set, were intensively studied. The current upper bound on the running time of the...

Protein Folding is an important open problem in the eld of Computational Biology Due to its com binatorial nature exact polynomial algorithms to solve it could not exist and so approximation algorithms and heurist...

Hybrid dynamic spatial approximation trees are recently proposed data structures for searching in metric spaces, based on combining the concepts of spatial approximation and pivot based algorithms. These data structures ...

Conventional operating systems, like Silicon Graphics' IRIX and IBM's AIX, adopt a single Memory Management algorithm. The choice of this algorithm is usually based on its good performance in relation to the set of progr...

Se presentan algoritmos para la generación de mallas poligonales a partir de conjuntos de puntos batimétricos correspondientes a canales de navegación, cuya geometría se corresponde con distintos cortes transversales...

Web Engines are a useful tool for searching information in the Web. But a great part of this information is non-textual and for that case a metric space is used. A metric space is a set where a notion of distance (call...

In visualization applications, the data has been increasing its size at very big rates. Processing of the whole data in main memory becomes impossible due to size limitations. A way of dealing with this constraint is to ...

Fuzzy rule-based systems have proved to be a convenient tool for modeling complex systems. This is due to their capacity to capture their typical imprecision, which makes classical methods inefficient. At present, Fuzzy...

The main objective of this work is to establish a basis for comparing BDI agents with the optimality of decision theory models such as POMDPs. It is argued that a direct comparison is not possible due to the intractabili...

This paper proposes two parallel variants of an Estimation of Distribution Algorithm (EDA) that represents the probability distribution by means of a single connected graphical model based on a polytree structure. The ma...

In order to be able to perform multimedia searches (like sounds, videos, images, etc.) we have to use data strucures like the Spatial Approximation Tree (SAT). This structure is a nice example of a tree structure in whic...

Se propone la ágil visualización de grandes escenarios exteriores a partir de la fusión de versiones simplificadas de modelos digitales de elevación y de fotografías aéreas o satelitales de la zona. Tales aproximac...

The Gale-Shapley "propose/reject" algorithm is a wellknown procedure for solving the classical stable marriage problem. In this paper we study this algorithm in the context of the many-to-many stable marriage problem, al...