Sciweavers

914 search results - page 74 / 183
» The Computational Complexity of Probabilistic Planning
Sort
View
CGF
2011
13 years 2 months ago
Intrinsic Shape Matching by Planned Landmark Sampling
Recently, the problem of intrinsic shape matching has received a lot of attention. A number of algorithms have been proposed, among which random-sampling-based techniques have bee...
Art Tevs, Alexander Berner, Michael Wand, Ivo Ihrk...
JAIR
2006
90views more  JAIR 2006»
13 years 10 months ago
Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4
In a field of research about general reasoning mechanisms, it is essential to have appropriate benchmarks. Ideally, the benchmarks should reflect possible applications of the deve...
Jörg Hoffmann, Stefan Edelkamp, Sylvie Thi&ea...
PODC
2010
ACM
14 years 2 months ago
Brief announcement: on the quest of optimal service ordering in decentralized queries
This paper deals with pipelined queries over services. The execution plan of such queries defines an order in which the services are called. We present the theoretical underpinni...
Efthymia Tsamoura, Anastasios Gounaris, Yannis Man...
NIPS
2008
14 years 6 days ago
Goal-directed decision making in prefrontal cortex: a computational framework
Research in animal learning and behavioral neuroscience has distinguished between two forms of action control: a habit-based form, which relies on stored action values, and a goal...
Matthew Botvinick, James An
AI
2011
Springer
13 years 5 months ago
Approximation of action theories and its application to conformant planning
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...
Phan Huy Tu, Tran Cao Son, Michael Gelfond, A. Ric...