#### Filter Results:

#### Publication Year

1996

2003

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

The need to declare channels as global objects of the applications implemented according to the Distributed Programming Occam-CSP model, limits the desirable reusability of the software-modules of the said applications. The integration of other languages that follow the OO paradigm is not easy either. In this paper, easy solutions are proposed to augment… (More)

CSP distributed programming model ooers formal bases that allow the development of high quality and secure distributed software for multicomputers. However, the model imposes restrictions that make it complicated to reuse software components developed with languages that follow the model. This problem is mainly due to each component in the application… (More)

A component-based methodological approach to derive distributed implementations of parallel ODE solvers is proposed. The proposal is based on the incorporation of explicit constructs for performance polymorphism into a methodology to derive group parallel programs of numerical methods from SPMD modules. These constructs enable the structuring of the… (More)

A component-based methodology to derive parallel stiff Ordinary Differential Equation (ODE) solvers for multi-computers is presented. The methodology allows the exploitation of the multilevel parallelism of this kind of numerical algorithms and the particular structure of ODE systems by using parallel linear algebra modules. The approach furthers the… (More)

The work proposes a new classiication of parallel algorithm schemes to program multicomputer systems, these schemes being called paradigms. The proposed classiication is intended to improve the programmabil-ity and portability of distributed parallel algorithms derived with these paradigms. In order to design algorithms and to implement applications based… (More)

A COmponent-based Methodology to derive Parallel programs to solve Ordinary Differential Equation (ODE) Solvers, termed COMPODES, is presented. The approach is useful to obtain distributed implementations of numerical algorithms which can be specified by combining linear algebra operations. The main contribution of the approach is the possibility of… (More)

This article presents a procedure for improving generalization in classiÿcation trees. This procedure consists of adjusting the nodes of a tree with the aim of moving the borders between regions in the problem space away from the neighboring training samples. The objective of this process is to place the borders in an optimal position inside the problem… (More)

- ‹
- 1
- ›