697 search results - page 36 / 140 » A Study of Evaluation Functions for the Graph K-Coloring Pro... |
ESWS
2006
Springer
13 years 11 months ago
2006
Springer
We present a comprehensive approach to ontology evaluation and validation, which have become a crucial problem for the development of semantic technologies. Existing evaluation met...
SEMWEB
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Ontologies are tools for describing and structuring knowledge, with many applications in searching and analyzing complex knowledge bases. Since building them manually is ...
EUROCOLT
1995
Springer
13 years 11 months ago
1995
Springer
Limiting identification of r.e. indexes for r.e. languages (from a presentation of elements of the language) and limiting identification of programs for computable functions (fr...
JAR
2000
13 years 7 months ago
2000
The paper compares two popular strategies for solving propositional satis ability, backtracking search and resolution, and analyzes the complexity of a directional resolution algo...
JC
2007
13 years 7 months ago
2007
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...