1047 search results - page 7 / 210 » Searching Without a Heuristic: Efficient Use of Abstraction |
ICDM
2003
IEEE
14 years 29 days ago
2003
IEEE
Learning Bayesian network structure from large-scale data sets, without any expertspecified ordering of variables, remains a difficult problem. We propose systematic improvements ...
IJCAI
1989
13 years 8 months ago
1989
Cognitive architectures aspire for generality both in terms of problem solving and learning across a range of problems, yet to date few examples of domain independent learning has...
AIPS
2004
13 years 9 months ago
2004
Conformant planning is the task of generating plans given uncertainty about the initial state and action effects, and without any sensing capabilities during plan execution. The p...
SARA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to...
ITS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We describe a theorem prover that is used in the Why2Atlas tutoring system for the purposes of evaluating the correctness of a student’s essay and for guiding feedback ...