Sciweavers

351 search results - page 16 / 71
» Perfect Constraints Are Tractable
Sort
View
CP
2006
Springer
13 years 11 months ago
The Theory of Grammar Constraints
Abstract. By introducing the Regular Membership Constraint, Gilles Pesant pioneered the idea of basing constraints on formal languages. The paper presented here is highly motivated...
Meinolf Sellmann
CP
2009
Springer
14 years 8 months ago
The Complexity of Valued Constraint Models
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
Peter G. Jeavons, Stanislav Zivný
ECAI
2008
Springer
13 years 9 months ago
Towards Efficient Belief Update for Planning-Based Web Service Composition
At the "functional level", Semantic Web Services (SWS) are described akin to planning operators, with preconditions and effects relative to an ontology; the ontology prov...
Jörg Hoffmann
AAAI
2004
13 years 9 months ago
The Complexity of Global Constraints
We study the computational complexity of reasoning with global constraints. We show that reasoning with such constraints is intractable in general. We then demonstrate how the sam...
Christian Bessière, Emmanuel Hebrard, Brahi...
WEBI
2009
Springer
14 years 2 months ago
An Empirical Study on Maximum Latency Saving in Web Prefetching
—This paper presents an empirical study to investigate the maximum benefits that web users can expect from prefetching techniques in the current web. To this end a perfect web p...
B. de la Ossa, Julio Sahuquillo, Ana Pont, Jos&eac...