1753 search results - page 94 / 351 » Reducibility of domain representations and Cantor-Weihrauch ... |
SARA
2009
Springer
14 years 3 months ago
2009
Springer
We present algorithms for testing the satisfiability and finding the tightened transitive closure of conjunctions of addition constraints of the form ±x ± y ≤ d and bound co...
AUTOMOTIVEUI
2009
ACM
14 years 3 months ago
2009
ACM
In this paper we present an approach for creating user infrom abstract representations for the automotive domain. The approach is based on transformations between different user ...
KCAP
2009
ACM
14 years 3 months ago
2009
ACM
Debugging inconsistent OWL ontologies is a timeconsuming task. Debugging services included in existing ontology engineering tools are still far from providing adequate support to ...
SISAP
2008
IEEE
14 years 3 months ago
2008
IEEE
Similarity search in sequence databases is of paramount importance in bioinformatics research. As the size of the genomic databases increases, similarity search of proteins in the...
FUZZIEEE
2007
IEEE
14 years 3 months ago
2007
IEEE
Compositional Modelling (CM) has been applied to synthesize automatically plausible scenarios in many problem domains with promising results. However, it is assumed that the generi...