565 search results - page 80 / 113 » Heuristics for Planning with SAT |
ESWA
2007
13 years 7 months ago
2007
The goal of assembly planning consists in generating feasible sequences to assemble a product and selecting an efficient assembly sequence from which related constraint factors su...
SSD
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we discuss a new type of query in Spatial Databases, called the Trip Planning Query (TPQ). Given a set of points of interest P in space, where each point belongs to ...
AIPS
2009
13 years 9 months ago
2009
Current state-of-the-art planners solve problems, easy and hard alike, by search, expanding hundreds or thousands of nodes. Yet, given the ability of people to solve easy problems...
VLDB
1992
ACM
14 years 12 hour ago
1992
ACM
In this paper, we explore the execution of pipelined hash joins in a multiprocessor-based database system. To improve the query execution, an innovative approach on query executio...
ECAI
2010
Springer
13 years 9 months ago
2010
Springer
Landmarks for a planning problem are subgoals that are necessarily made true at some point in the execution of any plan. Since verifying that a fact is a landmark is PSPACE-complet...