405 search results - page 73 / 81 » Approximation properties of the Generalized Finite Element M... |
LPKR
1997
Springer
13 years 11 months ago
1997
Springer
In this overview we show how Knowledge Representation (KR) can be done with the help of generalized logic programs. We start by introducing the core of PROLOG, which is based on de...
SC
2009
ACM
14 years 4 days ago
2009
ACM
It has been shown that the sparse grid combination technique can be a practical tool to solve high dimensional PDEs arising in multidimensional option pricing problems in finance...
PODS
2006
ACM
14 years 7 months ago
2006
ACM
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
In this paper we propose interaction-driven Markov games (IDMGs), a new model for multiagent decision making under uncertainty. IDMGs aim at describing multiagent decision problem...
ML
2007
ACM
13 years 7 months ago
2007
ACM
Abstract Surrogate maximization (or minimization) (SM) algorithms are a family of algorithms that can be regarded as a generalization of expectation-maximization (EM) algorithms. A...