Sciweavers

13784 search results - page 79 / 2757
» On Computing Functions with Uncertainty
Sort
View
WSC
2007
13 years 11 months ago
Extension of the direct optimization algorithm for noisy functions
DIRECT (DIviding RECTangles) is a deterministic global optimization algorithm for bound-constrained problems. The algorithm, based on a space-partitioning scheme, performs both gl...
Geng Deng, Michael C. Ferris
AUSAI
2008
Springer
13 years 11 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
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
ICDT
2010
ACM
219views Database» more  ICDT 2010»
14 years 6 months ago
Aggregate Queries for Discrete and Continuous Probabilistic XML
Sources of data uncertainty and imprecision are numerous. A way to handle this uncertainty is to associate probabilistic annotations to data. Many such probabilistic database mode...
Serge Abiteboul, T.-H Hubert Chan, Evgeny Kharlamo...
ISIPTA
2003
IEEE
117views Mathematics» more  ISIPTA 2003»
14 years 2 months ago
Dynamic Programming for Discrete-Time Systems with Uncertain Gain
We generalise the optimisation technique of dynamic programming for discretetime systems with an uncertain gain function. We assume that uncertainty about the gain function is des...
Gert de Cooman, Matthias C. M. Troffaes