Sciweavers

8413 search results - page 14 / 1683
» Ordering Problem Subgoals
Sort
View
AIPS
2011
12 years 11 months ago
Searching for Plans with Carefully Designed Probes
We define a probe to be a single action sequence computed greedily from a given state that either terminates in the goal or fails. We show that by designing these probes carefull...
Nir Lipovetzky, Hector Geffner
SIGMOD
2001
ACM
158views Database» more  SIGMOD 2001»
14 years 8 months ago
Generating Efficient Plans for Queries Using Views
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...
Foto N. Afrati, Chen Li, Jeffrey D. Ullman
ICWSM
2009
13 years 5 months ago
From Generating to Mining: Automatically Scripting Conversations Using Existing Online Sources
Hearing people argue opposing sides of an issue can be a useful way to understand the topic; however, these debates or conversations often don't exist. Unfortunately, generat...
Nathan D. Nichols, Lisa M. Gandy, Kristian J. Hamm...
CIKM
2010
Springer
13 years 6 months ago
Query optimization for ontology-based information integration
In recent years, there has been an explosion of publicly available RDF and OWL data sources. In order to effectively and quickly answer queries in such an environment, we present...
Yingjie Li, Jeff Heflin
SOICT
2010
13 years 2 months ago
Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering p
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
Pham Quang Dung, Phan-Thuan Do, Yves Deville, Tuon...