Sciweavers

1512 search results - page 145 / 303
» When Suboptimal Rules
Sort
View
MOR
2008
81views more  MOR 2008»
14 years 11 months ago
Optimal Stopping of Linear Diffusions with Random Discounting
Abstract. We propose a new solution method for optimal stopping problems with random discounting for linear diffusions whose state space has a combination of natural, absorbing, or...
Savas Dayanik
CORR
2004
Springer
146views Education» more  CORR 2004»
14 years 11 months ago
Mining Frequent Itemsets from Secondary Memory
Mining frequent itemsets is at the core of mining association rules, and is by now quite well understood algorithmically for main memory databases. In this paper, we investigate a...
Gösta Grahne, Jianfei Zhu
COMBINATORICS
2000
71views more  COMBINATORICS 2000»
14 years 11 months ago
Diagonal Checker-jumping and Eulerian Numbers for Color-signed Permutations
Abstract. We introduce color-signed permutations to obtain a very explicit combinatorial interpretation of the q-Eulerian identities of Brenti and some generalizations. In particul...
Niklas Eriksen, Henrik Eriksson, Kimmo Eriksson
IJAR
2002
109views more  IJAR 2002»
14 years 11 months ago
Belief function independence: I. The marginal case
In this paper, we study the notion of marginal independence between two sets of variables when uncertainty is expressed by belief functions as understood in the context of the tra...
Boutheina Ben Yaghlane, Philippe Smets, Khaled Mel...
APAL
1999
88views more  APAL 1999»
14 years 11 months ago
A Simple Propositional S5 Tableau System
We give a sound and complete propositional S5 tableau system of a particularly simple sort, having an easy completeness proof. It sheds light on why the satisfiability problem for...
Melvin Fitting