592 search results - page 8 / 119 » Learning Generalized Plans Using Abstract Counting |
EPIA
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. When a robot learns to solve a goal-directed navigation task with reinforcement learning, the acquired strategy can usually exclusively be applied to the task that has be...
OSDI
2008
ACM
13 years 10 months ago
2008
ACM
DryadLINQ is a system and a set of language extensions that enable a new programming model for large scale distributed computing. It generalizes previous execution environments su...
SAT
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Many problems are naturally expressed using CNF clauses and boolean cardinality constraints. It is generally believed that solving such problems through pure CNF encoding...
FSTTCS
2009
Springer
14 years 3 months ago
2009
Springer
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
Abstract— In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach support...