Sciweavers

573 search results - page 106 / 115
» Sentence generation as a planning problem
Sort
View
AIPS
2009
13 years 11 months ago
An Automatically Configurable Portfolio-based Planner with Macro-actions: PbP
While several powerful domain-independent planners have recently been developed, no one of these clearly outperforms all the others in every known benchmark domain. We present PbP...
Alfonso Gerevini, Alessandro Saetti, Mauro Vallati
AI
2004
Springer
13 years 9 months ago
ASSAT: computing answer sets of a logic program by SAT solvers
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by addin...
Fangzhen Lin, Yuting Zhao
MVA
2002
132views Computer Vision» more  MVA 2002»
13 years 9 months ago
Constituting Feasible Folding Operation Using Incomplete Crease Information
This paper proposes a novel approach to constituting all the feasible ways of folding, based on crease infomation obtained from an image of illustrations of general origami drill ...
Hiroshi Shimanuki, Jien Kato, Toyohide Watanabe
TSMC
1998
169views more  TSMC 1998»
13 years 9 months ago
Real-time map building and navigation for autonomous robots in unknown environments
—An algorithmic solution method is presented for the problem of autonomous robot motion in completely unknown environments. Our approach is based on the alternate execution of tw...
Giuseppe Oriolo, Giovanni Ulivi, Marilena Venditte...
SEMWEB
2010
Springer
13 years 7 months ago
Preference-Based Web Service Composition: A Middle Ground between Execution and Search
Abstract. Much of the research on automated Web Service Composition (WSC) relates it to an AI planning task, where the composition is primarily done offline prior to execution. Rec...
Shirin Sohrabi, Sheila A. McIlraith