Sciweavers

1264 search results - page 69 / 253
» The framework approach for constraint satisfaction
Sort
View
CORR
2008
Springer
153views Education» more  CORR 2008»
15 years 6 months ago
Decomposition Techniques for Subgraph Matching
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
Stéphane Zampelli, Martin Mann, Yves Devill...
NOMS
2008
IEEE
16 years 17 days ago
Utility-based placement of dynamic Web applications with fairness goals
Abstract—We study the problem of dynamic resource allocation to clustered Web applications. We extend application server middleware with the ability to automatically decide the s...
David Carrera, Malgorzata Steinder, Ian Whalley, J...
RE
2010
Springer
15 years 28 days ago
Fuzzy Goals for Requirements-Driven Adaptation
Self-adaptation is imposing as a key characteristic of many modern software systems to tackle their complexity and cope with the many environments in which they can operate. Self-a...
Luciano Baresi, Liliana Pasquale, Paola Spoletini
ENTCS
2007
91views more  ENTCS 2007»
15 years 6 months ago
Timed Concurrent Constraint Programming for Analysing Biological Systems
In this paper we present our rst approach to model and verify biological systems using ntcc, a concurrent constraint process calculus. We argue that the partial information const...
Julian Gutierrez, Jorge A. Pérez, Camilo Ru...
EDBT
2008
ACM
123views Database» more  EDBT 2008»
16 years 6 months ago
XML data integration in SixP2P: a theoretical framework
In the paper we discuss the problem of data integration in a P2P environment. In such setting each peer stores schema of its local data, mappings between the schema and schemas of...
Tadeusz Pankowski