Sciweavers

314 search results - page 6 / 63
» Goal Ordering in Partially Ordered Plans
Sort
View
DAM
2008
135views more  DAM 2008»
13 years 7 months ago
Edge ranking and searching in partial orders
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...
Dariusz Dereniowski
LOGCOM
2011
12 years 10 months ago
Introducing Preferences in Planning as Satisfiability
Planning as Satisfiability is one of the most well-known and effective techniques for classical planning: satplan has been the winning system in the deterministic track for optim...
Enrico Giunchiglia, Marco Maratea
ICDE
2002
IEEE
128views Database» more  ICDE 2002»
14 years 8 months ago
Efficiently Ordering Query Plans for Data Integration
The goal of a data integration system is to provide a uniform interface to a multitude of data sources. Given a user query formulated in this interface, the system translates it i...
AnHai Doan, Alon Y. Halevy
FLAIRS
2007
13 years 9 months ago
Case-Based Recommendation of Node Ordering in Planning
Currently, among the fastest approaches to AI task planning we find many forward-chaining heuristic planners, as FF. Most of their good performance comes from the use of domain-i...
Tomás de la Rosa, Angel García Olaya...
AIPS
2006
13 years 8 months ago
Planning with Temporally Extended Goals Using Heuristic Search
Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. Current planners for TEGs prune the search space during planni...
Jorge A. Baier, Sheila A. McIlraith