1047 search results - page 124 / 210 » Searching Without a Heuristic: Efficient Use of Abstraction |
CG
2002
Springer
13 years 7 months ago
2002
Springer
Abstract. Post's correspondence problem (PCP) is a classic undecidable problem. Its theoretical unbounded search space makes it hard to judge whether a PCP instance has a solu...
CG
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. The Monte-Carlo Tree Search algorithm has been successfully applied in various domains. However, its performance heavily depends on the Monte-Carlo part. In this paper, w...
KDD
2010
ACM
13 years 5 months ago
2010
ACM
The problem of graph classification has attracted great interest in the last decade. Current research on graph classification assumes the existence of large amounts of labeled tra...
ICA
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We discuss causal structure learning based on linear structural equation models. Conventional learning methods most often assume Gaussianity and create many indistinguish...
ICUMT
2009
13 years 5 months ago
2009
Abstract--Multimedia broadcast over a single frequency network (MBSFN) has attracted a lot of interest recently. This paper is on Golden coded spatial multiplexing MBSFN transmissi...