Sciweavers

542 search results - page 72 / 109
» The Denjoy alternative for computable functions
Sort
View
AAAI
2008
15 years 4 months ago
Another Look at Search-Based Drama Management
A drama manager (DM) monitors an interactive experience, such as a computer game, and intervenes to shape the global experience so it satisfies the author's expressive goals ...
Mark J. Nelson, Michael Mateas
AI
2008
Springer
15 years 2 months ago
Label ranking by learning pairwise preferences
Preference learning is a challenging problem that involves the prediction of complex structures, such as weak or partial order relations, rather than single values. In the recent ...
Eyke Hüllermeier, Johannes Fürnkranz, We...
IJAR
2006
98views more  IJAR 2006»
15 years 1 months ago
Inference in hybrid Bayesian networks with mixtures of truncated exponentials
Mixtures of truncated exponentials (MTE) potentials are an alternative to discretization for solving hybrid Bayesian networks. Any probability density function can be approximated...
Barry R. Cobb, Prakash P. Shenoy
CIE
2006
Springer
15 years 5 months ago
Lower Bounds Using Kolmogorov Complexity
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
Sophie Laplante
PVM
2000
Springer
15 years 5 months ago
Runtime Checking of Datatype Signatures in MPI
Abstract. The MPI standard provides a way to send and receive complex combinations of datatypes (e.g., integers and doubles) with a single communication operation. The MPI standard...
William Gropp