Sciweavers

999 search results - page 34 / 200
» On the Decidability of Functional Uncertainty
Sort
View
AUSAI
2008
Springer
13 years 10 months ago
Using Gaussian Processes to Optimize Expensive Functions
The task of finding the optimum of some function f(x) is commonly accomplished by generating and testing sample solutions iteratively, choosing each new sample x heuristically on t...
Marcus R. Frean, Phillip Boyle
SEMWEB
2007
Springer
14 years 2 months ago
OWL-CM: OWL Combining Matcher based on Belief Functions Theory
In this paper we propose a new tool called OWL-CM (OWL Combining Matcher) that deals with uncertainty inherent to ontology mapping process. On the one hand, OWL-CM uses the techniq...
Boutheina Ben Yaghlane, Najoua Laamari
GEOS
2009
Springer
14 years 1 months ago
A Functional Ontology of Observation and Measurement
An ontology of observation and measurement is proposed, which models the relevant information processes independently of sensor technology. It is kept at a sufficiently general lev...
Werner Kuhn
CORR
2004
Springer
100views Education» more  CORR 2004»
13 years 8 months ago
On the Theory of Structural Subtyping
We show that the first-order theory of structural subtyping of non-recursive types is decidable. Let be a language consisting of function symbols (representing type constructors)...
Viktor Kuncak, Martin C. Rinard
JACIII
2007
99views more  JACIII 2007»
13 years 8 months ago
Asymptotic Behavior of Linear Approximations of Pseudo-Boolean Functions
We study the problem of approximating pseudoBoolean functions by linear pseudo-Boolean functions. Pseudo-Boolean functions generalize ordinary Boolean functions by allowing the fu...
Guoli Ding, Robert F. Lax, Peter P. Chen, Jianhua ...