Sciweavers

73 search results - page 6 / 15
» A Landscape Analysis of Constraint Satisfaction Problems
Sort
View
FLAIRS
2007
15 years 3 days ago
Search Ordering Heuristics for Restarts-Based Constraint Solving
Constraint Satisfaction Problems are ubiquitous in Artificial Intelligence. Over the past decade significant advances have been made in terms of the size of problem instance tha...
Margarita Razgon, Barry O'Sullivan, Gregory M. Pro...
ENDM
2000
174views more  ENDM 2000»
14 years 9 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
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...
SARA
2009
Springer
15 years 4 months ago
Common Subexpressions in Constraint Models of Planning Problems
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
Andrea Rendl, Ian Miguel, Ian P. Gent, Peter Grego...
IJCAI
1993
14 years 11 months ago
Consistency Techniques for Numeric CSPs
Many problems can be expressed in terms of a numeric constraint satisfaction problem over finite or continuous domains (numeric CSP). The purpose of this paper is to show that the...
Olivier Lhomme