690 search results - page 42 / 138 » Dense Admissible Sets |
AAAI
2007
15 years 2 months ago
2007
We study the behavior of the classical A∗ search algorithm when coupled with a heuristic that provides estimates, accurate to within a small multiplicative factor, of the distan...
IJCAI
2007
15 years 1 months ago
2007
In recent years, the combinatorics of argumentation with arguments that can attack each other has been studied extensively. Especially, attack graphs (put in the focus of attentio...
KI
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. This paper investigates symbolic heuristic search with BDDs for solving domain-independent action planning problems cost-optimally. By distributimpact of operators that t...
124
click to vote
ADC
2003
Springer
15 years 5 months ago
2003
Springer
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
KDD
2002
ACM
16 years 7 days ago
2002
ACM
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...