592 search results - page 6 / 119 » Learning Generalized Plans Using Abstract Counting |
DASFAA
2004
IEEE
14 years 4 days ago
2004
IEEE
Abstract. We consider the problem of accurately estimating the number of approximate XML answers for a given query, and propose an efficient method that (1) accurately computes sel...
AGENTS
1999
Springer
14 years 21 days ago
1999
Springer
Uncertain and complex environments demand that an agent be able to anticipate the actions of others in order to avoid resource conflicts with them and to realize its goals. Confli...
ICONIP
2004
13 years 9 months ago
2004
Abstract. This paper examines the generalization capability in learning multiple temporal patterns by the recurrent neural network with parametric bias (RNNPB). Our simulation expe...
AAAI
2008
13 years 10 months ago
2008
Currently, the most effective complete SAT solvers are based on the DPLL algorithm augmented by clause learning. These solvers can handle many real-world problems from application...
ISRR
2005
Springer
14 years 1 months ago
2005
Springer
ys when planning meant searching for a sequence of abstract actions that satisfied some symbolic predicate. Robots can now learn their own representations through statistical infe...