Sciweavers

56 search results - page 4 / 12
» SOGgy Constraints: Soft Open Global Constraints
Sort
View
ACMICEC
2006
ACM
89views ECommerce» more  ACMICEC 2006»
14 years 1 months ago
A semantic web approach to handling soft constraints in virtual organisations
In this paper we present a proposal for representing soft constraint satisfaction problems (CSPs) within the Semantic Web architecture. The proposal is motivated by the need for a...
Alun D. Preece, Stuart Chalmers, Craig McKenzie, J...
CVPR
2008
IEEE
14 years 9 months ago
High-arity interactions, polyhedral relaxations, and cutting plane algorithm for soft constraint optimisation (MAP-MRF)
LP relaxation approach to soft constraint optimisation (i.e. MAP-MRF) has been mostly considered only for binary problems. We present its generalisation to n-ary problems, includi...
Tomás Werner
TCAD
2002
73views more  TCAD 2002»
13 years 7 months ago
A timing-constrained simultaneous global routing algorithm
In this paper, we propose a new approach for VLSI interconnect global routing that can optimize both congestion and delay, which are often competing objectives. Our approach provi...
Jiang Hu, Sachin S. Sapatnekar
KBS
2007
103views more  KBS 2007»
13 years 7 months 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
CPAIOR
2007
Springer
14 years 1 months ago
The Deviation Constraint
This paper introduces DEVIATION, a soft global constraint to obtain balanced solutions. A violation measure of the perfect balance can be defined as the Lp norm of the vector vari...
Pierre Schaus, Yves Deville, Pierre Dupont, Jean-C...