Sciweavers

635 search results - page 13 / 127
» Some Computational Problems Related to Pseudo-intents
Sort
View
LPAR
2005
Springer
15 years 3 months ago
Termination of Fair Computations in Term Rewriting
Abstract. The main goal of this paper is to apply rewriting termination technology —enjoying a quite mature set of termination results and tools— to the problem of proving auto...
Salvador Lucas, José Meseguer
IANDC
2008
131views more  IANDC 2008»
14 years 9 months ago
Termination of just/fair computations in term rewriting
The main goal of this paper is to apply rewriting termination technology --enjoying a quite mature set of termination results and tools-- to the problem of proving automatically t...
Salvador Lucas, José Meseguer
SDM
2009
SIAM
114views Data Mining» more  SDM 2009»
15 years 6 months ago
On the Comparison of Relative Clustering Validity Criteria.
Many different relative clustering validity criteria exist that are very useful in practice as quantitative measures for evaluating the quality of data partitions, and new criter...
Lucas Vendramin, Ricardo J. G. B. Campello, Eduard...
OTM
2007
Springer
15 years 3 months ago
Volunteer Computing, an Interesting Option for Grid Computing: Extremadura as Case Study
This paper presents the works done by several research groups from University of Extremadura and CETA-CIEMAT (Centro Extreme˜no de Tecnolog´ıas Avanzadas) in order to deploy an ...
Miguel Cárdenas Montes, Miguel A. Vega-Rodr...

Lecture Notes
4961views
16 years 7 months ago
The Relational Data Model, Normalisation and effective Database Design
I have been designing and building applications, including the databases used by those applications, for several decades now. I have seen similar problems approached by different d...
Tony Marston