971 search results - page 37 / 195 » Planning with Reduced Operator Sets |
APIN
2004
14 years 9 months ago
2004
In this paper we are concerned with the problem of learning how to solve planning problems in one domain given a number of solved instances. This problem is formulated as the probl...
116
click to vote
AI
2011
Springer
14 years 5 months ago
2011
Springer
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...
MICRO
1994
IEEE
15 years 2 months ago
1994
IEEE
Numerical applications frequently contain nested loop structures that process large arrays of data. The execution of these loop structures often produces memory preference pattern...
117
click to vote
SOSP
2009
ACM
15 years 6 months ago
2009
ACM
Data-intensive applications are increasingly designed to execute on large computing clusters. Grouped aggregation is a core primitive of many distributed programming models, and i...
AIPS
2007
15 years 9 days ago
2007
This paper describes MEXAR2, a software tool that is currently used to synthesize the operational commands for data downlink from the on-board memory of an interplanetary space mi...