Cesar L. Alonso
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Cesar L. Alonso has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Cruz Enrique Borges
Institute of Technology, Faculty of Engineering, University of Deusto, Av. Universidades, 24, 48007 Bilbao, Spain
2 shared publications - José Luis Montaña
Universidad de Cantabria
2 shared publications - Alfonso Ortega
Universidad Autónoma de Madrid 28049 Madrid Spain
1 shared publication - Camino Rodríguez Vela
University of Oviedo, Gijón, Spain
1 shared publication - Jaime Gutierrez
Departamento de Matemática Aplicada y Ciencias de la Computación, Universidad de Cantabria, Santander, Spain
1 shared publication Jorge Puente
Centro de Inteligencia Artificial , Universidad de Oviedo
1 shared publication
Latest Publications
- 1 January 2012
- Published by Springer Nature
- p. 49-65
Model Regularization in Coevolutionary Architectures Evolving Straight Line Code
- 1 January 2012
- Published by Springer Nature
- p. 49-65
Model Regularization in Coevolutionary Architectures Evolving Straight Line Code
- 1 January 2001
- Published by Springer Nature
- p. 3-9
On the Dimension and the Number of Parameters of a Unirational Variety
- 1 January 2001
- Published by Springer Nature
- p. 3-9
On the Dimension and the Number of Parameters of a Unirational Variety
- 1 January 2001
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 78 (4) , 499-520
Ordered structures for parallel rule-based computations
In this paper we present an effective strategy to compute a partial order relation among the literals of a query given by a conjuction of first order literals. This ordering expresses sufficient conditions in order for the subgoals of the query were independent each one to the others and hence they can be evaluated in parallel. To represent the partial ordering so that an efficient strategy to join partial solutions from the subgoals can be obtained, we introduce a structure named the Data Flow Lattice. The problem of determining the optimum partial ordering is proved to be NP-hard, therefore we propose an heuristic algorithm that requires polynomial time in the number of literals and variables of the query. We add also an illustrative example of the algorithm performance.
- 1 January 2001
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 78 (4) , 499-520
Ordered structures for parallel rule-based computations
In this paper we present an effective strategy to compute a partial order relation among the literals of a query given by a conjuction of first order literals. This ordering expresses sufficient conditions in order for the subgoals of the query were independent each one to the others and hence they can be evaluated in parallel. To represent the partial ordering so that an efficient strategy to join partial solutions from the subgoals can be obtained, we introduce a structure named the Data Flow Lattice. The problem of determining the optimum partial ordering is proved to be NP-hard, therefore we propose an heuristic algorithm that requires polynomial time in the number of literals and variables of the query. We add also an illustrative example of the algorithm performance.