Sciweavers

314 search results - page 9 / 63
» Goal Ordering in Partially Ordered Plans
Sort
View
IJCAI
1989
13 years 8 months ago
Using and Refining Simplifications: Explanation-Based Learning of Plans in Intractable Domains
This paper describes an explanation-based approach lo learning plans despite a computationally intractable domain theory. In this approach, the system learns an initial plan using...
Steve A. Chien
AIPS
2009
13 years 8 months ago
Extended Goals for Composing Services
The ability to automatically compose Web Services is critical for realising more complex functionalities. Several proposals to use automated planning to deal with the problem of s...
Eirini Kaldeli, Alexander Lazovik, Marco Aiello
AIL
2000
78views more  AIL 2000»
13 years 7 months ago
Representation of formal dispute with a standing order
Computational dialectics is a relatively new field. It is, among others, concerned with the formal representation of argument and dispute. The goal is to suggest algorithms, proce...
Gerard Vreeswijk
TIP
2010
136views more  TIP 2010»
13 years 5 months ago
Wavelet Steerability and the Higher-Order Riesz Transform
Abstract— Our main goal in this paper is to set the foundations of a general continuous-domain framework for designing steerable, reversible signal transformations (a.k.a. frames...
Michael Unser, Dimitri Van De Ville
AIPS
1996
13 years 8 months ago
Planning for Manufacturing Workpieces by Storing, Indexing and Replaying Planning Decisions
Planning for manufacturing workpiecesis a complex task that requires the interaction of a domain-specific reasoner and a generic planning mechanism.In this paper wepresent an arch...
Hector Muñoz-Avila, Frank Weberskirch