Sciweavers

283 search results - page 50 / 57
» Deterministic Polynomial Time Algorithms for Matrix Completi...
Sort
View
CP
2006
Springer
13 years 11 months ago
Preprocessing QBF
In this paper we investigate the use of preprocessing when solving Quantified Boolean Formulas (QBF). Many different problems can be efficiently encoded as QBF instances, and there...
Horst Samulowitz, Jessica Davies, Fahiem Bacchus
PODS
2012
ACM
297views Database» more  PODS 2012»
11 years 10 months ago
Query-based data pricing
Data is increasingly being bought and sold online, and Webbased marketplace services have emerged to facilitate these activities. However, current mechanisms for pricing data are ...
Paraschos Koutris, Prasang Upadhyaya, Magdalena Ba...
RTSS
1992
IEEE
13 years 11 months ago
Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...
Chao-Ju Hou, Kang G. Shin
FOCS
1998
IEEE
13 years 11 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
ICSOC
2007
Springer
14 years 1 months ago
Execution Optimization for Composite Services Through Multiple Engines
Web services are rapidly emerging as a popular standard for sharing data and functionality among heterogeneous systems. We propose a general purpose Web Service Management System (...
Wubin Li, Zhuofeng Zhao, Jun Fang, Kun Chen