Sciweavers

39 search results - page 4 / 8
» Efficient Pruning of Operators in Planning Domains
Sort
View
VLDB
2005
ACM
152views Database» more  VLDB 2005»
14 years 7 months ago
Composing, optimizing, and executing plans for bioinformatics web services
The emergence of a large number of bioinformatics datasets on the Internet has resulted in the need for flexible and efficient approaches to integrate information from multiple bio...
Snehal Thakkar, José Luis Ambite, Craig A. Knoblo...
AIPS
2008
13 years 9 months ago
A Compact and Efficient SAT Encoding for Planning
In the planning-as-SAT paradigm there have been numerous recent developments towards improving the speed and scalability of planning at the cost of finding a step-optimal parallel...
Nathan Robinson, Charles Gretton, Duc Nghia Pham, ...
ICDE
2010
IEEE
801views Database» more  ICDE 2010»
14 years 7 months ago
The Similarity Join Database Operator
Similarity joins have been studied as key operations in multiple application domains, e.g., record linkage, data cleaning, multimedia and video applications, and phenomena detectio...
Mohamed H. Ali, Walid G. Aref, Yasin N. Silva
EPS
1998
Springer
13 years 11 months ago
Evolving Heuristics for Planning
Abstract. In this paper we describe EvoCK, a new approach to the application of genetic programming (GP) to planning. This approach starts with a traditional AI planner (PRODIGY)an...
Ricardo Aler, Daniel Borrajo, Pedro Isasi
RAS
2008
149views more  RAS 2008»
13 years 6 months ago
Robot task planning using semantic maps
Task planning for mobile robots usually relies solely on spatial information and on shallow domain knowledge, like labels attached to objects and places. Although spatial informat...
Cipriano Galindo, Juan-Antonio Fernandez-Madrigal,...