2266 search results - page 162 / 454 » Some Solutions to the Ignoring Problem |
175
click to vote
IJCAI
1989
15 years 7 months ago
1989
We consider a representation for temporal relations between intervals introduced by James Allen, and its associated computational or reasoning problem: given possibly indefinite ...
168
click to vote
IJPRAI
1998
15 years 6 months ago
1998
We present in this paper a novel method for eliciting the conditional probability matrices needed for a Bayesian network with the help of a neural network. We demonstrate how we c...
184
click to vote
JCO
2010
15 years 5 months ago
2010
We study the extremal parameter N(n, m, H) which is the largest number of copies of a hypergraph H that can be formed of at most n vertices and m edges. Generalizing previous work...
158
click to vote
TCS
2010
15 years 4 months ago
2010
Abstract. It is an open problem in the area of effective (algorithmic) randomness whether Kolmogorov-Loveland randomness coincides with Martin-L¨of randomness. Joe Miller and And...
174
click to vote
FCS
2006
15 years 8 months ago
2006
: In the complete graph K2m+3 for m 2, we study some structures of simple non-isomorphic Hamiltonian sub-graphs of the form H ( 2m+3 , 6m+3) for m 2 . The various structures of t...