Sciweavers

4266 search results - page 335 / 854
» The container loading problem
Sort
View
159
Voted
ICDT
2001
ACM
110views Database» more  ICDT 2001»
15 years 9 months ago
On Answering Queries in the Presence of Limited Access Patterns
In information-integration systems, source relations often have limitations on access patterns to their data; i.e., when one must provide values for certain attributes of a relatio...
Chen Li, Edward Y. Chang
148
Voted
CSR
2008
Springer
15 years 6 months ago
On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata
Abstract. While visibly pushdown languages properly generalise regular languages and are properly contained in deterministic context-free languages, the complexity of their members...
Nutan Limaye, Meena Mahajan, Antoine Meyer
134
Voted
ICWS
2008
IEEE
15 years 6 months ago
An Efficient Syntactic Web Service Composition Algorithm Based on the Planning Graph Model
In this paper, we have studied a common Web service composition problem, the syntactic matching problem, where the output parameters of a Web service can be used as the input para...
Xianrong Zheng, Yuhong Yan
AAAI
2006
15 years 6 months ago
Weighted Constraint Satisfaction with Set Variables
Set variables are ubiquitous in modeling (soft) constraint problems, but efforts on practical consistency algorithms for Weighted Constraint Satisfaction Problems (WCSPs) have onl...
J. H. M. Lee, C. F. K. Siu
ACID
2006
239views Algorithms» more  ACID 2006»
15 years 6 months ago
Stable Marriage with Ties and Bounded Length Preference Lists
We consider variants of the classical stable marriage problem in which preference lists may contain ties, and may be of bounded length. Such restrictions arise naturally in practic...
Robert W. Irving, David Manlove, Gregg O'Malley