Sciweavers

566 search results - page 27 / 114
» Solution Reuse in Dynamic Constraint Satisfaction Problems
Sort
View
98
Voted
FLAIRS
2008
15 years 2 months ago
Distributed University Timetabling with Multiply Sectioned Constraint Networks
Although timetabling has long been studied through constraint satisfaction based techniques, along with many alternatives, only recently work has been reported where distributed t...
Yang Xiang, Wanling Zhang
87
Voted
NOMS
2008
IEEE
15 years 6 months 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...
107
Voted
KBS
2007
103views more  KBS 2007»
15 years 8 days ago
A reusable commitment management service using Semantic Web technology
Commitment management is a key issue in service-provisioning in the context of virtual organisations (VOs). A service-provider — which may be a single agent acting within an orga...
Alun D. Preece, Stuart Chalmers, Craig McKenzie
110
Voted
CP
2008
Springer
15 years 2 months ago
Model Restarts for Structural Symmetry Breaking
ctural abstractions that were introduced in [17]. Compared with other symmetry-breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodate dynami...
Daniel S. Heller, Aurojit Panda, Meinolf Sellmann,...
102
Voted
ICCS
2001
Springer
15 years 4 months ago
An Application of the Process Mechanism to a Room Allocation Problem Using the pCG Language
The Sisyphus-I initiative consists of a constraint satisfaction problem in which a group of people in a research environment must be allocated rooms. Numerous constraints are detai...
David Benn, Dan Corbett