Sciweavers

942 search results - page 77 / 189
» Distance Constraint Satisfaction Problems
Sort
View
AUSAI
2005
Springer
14 years 12 months ago
A Comparison of Evolutionary Methods for the Discovery of Local Search Heuristics
Abstract. Methods of adaptive constraint satisfaction have recently become of interest to overcome the limitations imposed on “black-box” search algorithms by the no free lunch...
Stuart Bain, John Thornton, Abdul Sattar
IFM
2009
Springer
15 years 4 months ago
Verifying UML/OCL Operation Contracts
In current model-driven development approaches, software models are the primary artifacts of the development process. Therefore, assessment of their correctness is a key issue to e...
Jordi Cabot, Robert Clarisó, Daniel Riera
CORR
2008
Springer
76views Education» more  CORR 2008»
14 years 10 months ago
An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
Alexandre Goldsztejn, Claude Michel, Michel Rueher
CP
2003
Springer
15 years 3 months ago
Open Constraint Optimization
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...
Boi Faltings, Santiago Macho-Gonzalez
AIPS
2006
14 years 11 months ago
Planning for PDDL3 - An OCSP Based Approach
Recent research in AI Planning is focused on improving the quality of the generated plans. PDDL3 incorporates hard and soft constraints on goals and the plan trajectory. Plan traj...
Bharat Ranjan Kavuluri, Naresh Babu Saladi, Deepak...