Sciweavers

4047 search results - page 291 / 810
» The Discrete Basis Problem
Sort
View
DEDS
2010
97views more  DEDS 2010»
15 years 4 months ago
On Regression-Based Stopping Times
We study approaches that fit a linear combination of basis functions to the continuation value function of an optimal stopping problem and then employ a greedy policy based on the...
Benjamin Van Roy
CSDA
2006
94views more  CSDA 2006»
15 years 4 months ago
Signal extraction for simulated games with a large number of players
A signal extraction problem in simulated games is studied. A modelling technique is proposed for deriving beliefs for players in simulated games. Since standard Bayesian games pro...
Aki Lehtinen
IJDMMM
2008
87views more  IJDMMM 2008»
15 years 4 months ago
Is an ordinal class structure useful in classifier learning?
In recent years, a number of machine learning algorithms have been developed for the problem of ordinal classification. These algorithms try to exploit, in one way or the other, t...
Jens C. Huhn, Eyke Hüllermeier
JCSS
2008
73views more  JCSS 2008»
15 years 4 months ago
Structure identification of Boolean relations and plain bases for co-clones
We give a quadratic algorithm for the following structure identification problem: given a Boolean relation R and a finite set S of Boolean relations, can the relation R be express...
Nadia Creignou, Phokion G. Kolaitis, Bruno Zanutti...
JAR
2007
90views more  JAR 2007»
15 years 4 months ago
A Tableau Decision Procedure for SHOIQ
Abstract. OWL DL, a new W3C ontology language recommendation, is based on the expressive description logic SHOIN. Although the ontology consistency problem for SHOIN is known to be...
Ian Horrocks, Ulrike Sattler