Sciweavers

655 search results - page 71 / 131
» Evolving Heuristics for Planning
Sort
View
AIPS
2009
15 years 1 months ago
Inference and Decomposition in Planning Using Causal Consistent Chains
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...
Nir Lipovetzky, Hector Geffner
COMPSAC
2006
IEEE
15 years 6 months ago
Preventing Feature Interactions by Constraints
As software systems evolve by adding new extensions some unexpected conflicts may occur, which is known as the Feature Interaction Problem (FIP). FIP is a threat to the dependabil...
Jihong Zuo, Qianxiang Wang, Hong Mei
81
Voted
VLDB
1992
ACM
111views Database» more  VLDB 1992»
15 years 3 months ago
Using Segmented Right-Deep Trees for the Execution of Pipelined Hash Joins
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...
Ming-Syan Chen, Ming-Ling Lo, Philip S. Yu, Honest...
ECAI
2010
Springer
15 years 29 days ago
Sound and Complete Landmarks for And/Or Graphs
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...
Emil Keyder, Silvia Richter, Malte Helmert
AAI
2005
117views more  AAI 2005»
14 years 11 months ago
Machine Learning in Hybrid Hierarchical and Partial-Order Planners for Manufacturing Domains
The application of AI planning techniques to manufacturing systems is being widely deployed for all the tasks involved in the process, from product design to production planning an...
Susana Fernández, Ricardo Aler, Daniel Borr...