Sciweavers

721 search results - page 80 / 145
» GRASP - evolution for constraint satisfaction problems
Sort
View
TSE
2008
107views more  TSE 2008»
14 years 9 months ago
Security Requirements Engineering: A Framework for Representation and Analysis
This paper presents a framework for security requirements elicitation and analysis. The framework is based on constructing a context for the system, representing security requireme...
Charles B. Haley, Robin C. Laney, Jonathan D. Moff...
ECAI
2008
Springer
14 years 11 months ago
A Decomposition Technique for Max-CSP
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
Hachemi Bennaceur, Christophe Lecoutre, Olivier Ro...
CP
2008
Springer
14 years 11 months ago
Probabilistically Estimating Backbones and Variable Bias: Experimental Overview
Backbone variables have the same assignment in all solutions to a given constraint satisfaction problem; more generally, bias represents the proportion of solutions that assign a v...
Eric I. Hsu, Christian J. Muise, J. Christopher Be...
AAAI
1997
14 years 11 months ago
Bayes Networks for Estimating the Number of Solutions to a CSP
The problem of counting the number of solutions to a constraint satisfaction problem (CSP) is rephrased in terms of probability updating in Bayes networks. Approximating the proba...
Amnon Meisels, Solomon Eyal Shimony, Gadi Solotore...
EMO
2009
Springer
174views Optimization» more  EMO 2009»
15 years 4 months ago
Constraint Programming
To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision...
Pascal Van Hentenryck