Sciweavers

714 search results - page 73 / 143
» Lexicographically-ordered constraint satisfaction problems
Sort
View
CORR
2010
Springer
69views Education» more  CORR 2010»
13 years 10 months ago
Efficient Knowledge Base Management in DCSP
DCSP (Distributed Constraint Satisfaction Problem) has been a very important research area in AI (Artificial Intelligence). There are many application problems in distributed AI t...
Hong Jiang
CP
1999
Springer
14 years 2 months ago
A Framework for Constraint Programming Based Column Generation
Column generation is a state-of-the-art method for optimally solving di cult large-scale optimization problems such as airline crew assignment. We show how to apply column generati...
Ulrich Junker, Stefan E. Karisch, Niklas Kohl, Bo ...
CP
2011
Springer
12 years 9 months ago
Pruning Rules for Constrained Optimisation for Conditional Preferences
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...
Nic Wilson, Walid Trabelsi
IFM
2009
Springer
14 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
AUSAI
2005
Springer
13 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