Sciweavers

1713 search results - page 131 / 343
» Planning for Performance
Sort
View
SIGMOD
2006
ACM
110views Database» more  SIGMOD 2006»
16 years 4 months ago
Supporting ad-hoc ranking aggregates
This paper presents a principled framework for efficient processing of ad-hoc top-k (ranking) aggregate queries, which provide the k groups with the highest aggregates as results....
Chengkai Li, Kevin Chen-Chuan Chang, Ihab F. Ilyas
AIM
2004
15 years 4 months ago
An AI Planning-based Tool for Scheduling Satellite Nominal Operations
Satellite domains are becoming a fashionable area of research within the AI community due to the complexity of the problems that these domains need to solve. With the current US a...
María Dolores Rodríguez-Moreno, Dani...
WSC
2004
15 years 6 months ago
Simulating Availability Outlook for E-Commerce Business of Personal Computer Sales
For newly designed or transformed business processes, accurately predicting business performances such as costs and customer services before actual deployment is very important. W...
Young M. Lee
ICDE
2000
IEEE
125views Database» more  ICDE 2000»
16 years 6 months ago
An Algebraic Compression Framework for Query Results
Decision-support applications in emerging environments require that SQL query results or intermediate results be shipped to clients for further analysis and presentation. These cl...
Zhiyuan Chen, Praveen Seshadri
ECAI
2010
Springer
15 years 5 months 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