Sciweavers

2889 search results - page 188 / 578
» Querying Structured Hyperdocuments
Sort
View
CIA
2006
Springer
14 years 18 hour ago
Iterative Query-Based Approach to Efficient Task Decomposition and Resource Allocation
Intelligent coordination in complex multi-agent environments requires sophisticated mechanisms for suboptimal task decomposition and efficient resource allocation provided by the t...
Michal Pechoucek, Ondrej Lerch, Jirí B&iacu...
UAI
2003
13 years 9 months ago
Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
David Larkin
ICDE
2008
IEEE
131views Database» more  ICDE 2008»
14 years 9 months ago
Parallel Evaluation of Composite Aggregate Queries
Aggregate measures summarizing subsets of data are valuable in exploratory analysis and decision support, especially when dependent aggregations can be easily specified and compute...
Lei Chen 0003, Christopher Olston, Raghu Ramakrish...
EDBT
2004
ACM
147views Database» more  EDBT 2004»
14 years 8 months ago
Efficient Query Evaluation over Compressed XML Data
XML suffers from the major limitation of high redundancy. Even if compression can be beneficial for XML data, however, once compressed, the data can be seldom browsed and queried i...
Andrei Arion, Angela Bonifati, Gianni Costa, Sandr...
ICDE
2008
IEEE
204views Database» more  ICDE 2008»
14 years 2 months ago
Parallel Distributed Processing of Constrained Skyline Queries by Filtering
— Skyline queries are capable of retrieving interesting points from a large data set according to multiple criteria. Most work on skyline queries so far has assumed a centralized...
Bin Cui, Hua Lu, Quanqing Xu, Lijiang Chen, Yafei ...