Search academic resources

We present the results of our work on applying genetic algorithms combined with a discrete event simulation to the problem of convoy scheduling. We show that this approach can automatically remove conflicts from a convoy...

The paper analyses and compares alternative iterative and recursive implementations of N-ary search algorithms in hardware (in field programmable gate arrays, in particular). The improvements over the previous results ha...

In this paper, we focus on two problems of the Web service-based business process integration: the discovery of Web services based on the capabilities and properties of published services, and the composition of business...

Industrial planning has experienced notable advancements since its beginning by the middle of the 20th century. The importance of its application within the several industries where it is used has been demonstrated, rega...

The intensive and continuous use of high-performance computers for executing computationally intensive applications, coupled with the large number of elements that make them up, dramatically increase the likelihood of fa...

In spite of the NP-completeness of the satisfiability decision problem (SAT problem), many researchers have been attracted by it because SAT has many applications in Artificial Intelligence. This paper presents a randomi...

Historically Functional Programming FP for short has been associated with a small scope of applications mainly academic The computer science community did not pay enough attention to its potential perhaps due t...

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...

La consulta de reunión (join) es una de las operaciones fundamentales en un Sistema de Administración de Bases de Datos (DBMS). Debido a que los (DBMS) modernos han incorporado nuevos tipos de bases de datos (temporal,...

The AMTHA (Automatic Mapping Task on Heterogeneous Architectures) algorithm for task-to-processors assignment and the MPAHA (Model of Parallel Algorithms on Heterogeneous Architectures) model are presented. The use of A...

Existen aplicaciones que requieren manejar objetos espacio-temporales, es decir, objetos cuya posición espacial o forma cambia en distintos instantes de tiempo. Para administrar la información referida a tales cambios ...

A MPAHA (Model for Parallel Algorithms on Heterogeneous Architectures) model that allows predicting parallel application performance running over heterogeneous architectures is presented. MPAHA considers the heterogeneit...

Biologically realistic computer simulation of vertebrate locomotion is an interesting and challenging problem with applications in computer graphics and robotics. One current approach simulates a relatively simple verteb...

This paper describes an algorithm to determine whether a point is inside or outside a curvilinear polygon, based on the well known algorithm consisting of counting the intersections of an horizontal ray with the polygon....

The Estimation Distribution Algorithms (EDAs) compose an evolutionary metaheuristic whose main characteristic is the construction of solutions in randomly form, using a distribution of probabilities that evolves during t...

In the information age, knowledge leads to profits, power and success. As an ancestor of data mining, machine learning has concerned itself with discovery of new knowledge on its own. This paper presents experiment resul...

Nowadays, the digital circuit production is carried out specifying the circuit functionality using a hardware description language. Then, this specification is synthesized down to a structural netlist suitable for use by...

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 design of intelligent agents is a key issue for many applications. Although there is no universally accepted de nition of intelligence, a notion of rational agency has been proposed as an alternative for the characte...

In this paper, we solve some benchmarks of Set Covering Problem and Equality Constrained Set Covering or Set Partitioning Problem. The resolution techniques used to solve them were Ant Colony Optimization algorithms and ...

Argumentation systems have substantially evolved in the past few years, resulting in adequate tools to model some forms of common sense reasoning. This has sprung a new set of argument-based applications in diverse are...

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 ...

Um grande número de aplicações necessitam de esquemas que assegure:m uma execução tolerante a falhas. Diversos algoritmos foram criados para implementar técnicas de recuperação de erros na execução de programas...

In this paper we present algorithms and computational implementation of the Shapley Value and Banzhaf– Coleman Index of Power. Both indices describe the real power of the coalitions involved in strategic interactions. ...