Sciweavers

2981 search results - page 64 / 597
» Answer Set Planning
Sort
View
JACM
2012
13 years 5 months ago
Continuous sampling from distributed streams
A fundamental problem in data management is to draw and maintain a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With la...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
AI
2011
Springer
14 years 10 months ago
State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
Daniel Bryce, William Cushing, Subbarao Kambhampat...
NDQA
2004
124views Education» more  NDQA 2004»
15 years 4 months ago
Reuse in Question Answering: A Preliminary Study
People when asked a number of questions about a particular topic begin to become knowledgeable about the topic as they look for and find answers to the questions. A question answe...
Marc Light, Abraham Ittycheriah, Andrew Latto, Nan...
ICDCS
2008
IEEE
15 years 9 months ago
Multi-query Optimization for Distributed Similarity Query Processing
This paper considers a multi-query optimization issue for distributed similarity query processing, which attempts to exploit the dependencies in the derivation of a query evaluati...
Yi Zhuang, Qing Li, Lei Chen 0002
JPDC
2008
115views more  JPDC 2008»
15 years 3 months ago
On Byzantine generals with alternative plans
This paper proposes a variation of the Byzantine generals problem (or Byzantine consensus). Each general has a set of good plans and a set of bad plans. The problem is to make all...
Miguel Correia, Alysson Neves Bessani, Paulo Ver&i...