Sciweavers

1264 search results - page 34 / 253
» The framework approach for constraint satisfaction
Sort
View
CP
2008
Springer
15 years 3 months ago
A Branch and Bound Algorithm for Numerical MAX-CSP
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
Jean-Marie Normand, Alexandre Goldsztejn, Marc Chr...
204
Voted
CP
2009
Springer
16 years 2 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ý
ENDM
2000
174views more  ENDM 2000»
15 years 1 months ago
Hybrid Constraints in Automated Model Synthesis and Model Processing
Both parametric design tasks and analysis tasks of technical systems have a similar problem setting: The structure of the system to be configured or analyzed is defined already. W...
Klaus-Ulrich Leweling, Benno Stein
ECSQARU
2007
Springer
15 years 8 months ago
Algebraic Structures for Bipolar Constraint-Based Reasoning
The representation of both scales of cost and scales of benefit is very natural in a decision-making problem: scales of evaluation of decisions are often bipolar. The aim of this ...
Hélène Fargier, Nic Wilson
SIGSOFT
2004
ACM
16 years 2 months ago
Reasoning about partial goal satisfaction for requirements and design engineering
Exploring alternative options is at the heart of the requirements and design processes. Different alternatives contribute to different degrees of achievement of non-functional goa...
Emmanuel Letier, Axel van Lamsweerde