601 search results - page 1 / 121 » CSP(M): Constraint Satisfaction Problem over Models |
MODELS
2009
Springer
14 years 3 months ago
2009
Springer
GCC
2003
Springer
14 years 4 months ago
2003
Springer
A novel combination of genetic algorithms and constraint satisfaction modelling for the solution of two and multi-layer over-thecell channel routing problems is presented. The two ...
CIE
2008
Springer
13 years 11 months ago
2008
Springer
We study the complexity of the model checking problem, for fixed models A, over certain fragments L of first-order logic, obtained by restricting which of the quantifiers and boole...
FLAIRS
2007
14 years 1 months ago
2007
We deal with the search process of the GraphPlan algorithm in this paper. We concentrate on a problem of finding supports for a sub-goal which arises during the search. We model t...
IJCAI
1993
14 years 6 days ago
1993
Constraint relaxation is a frequently used technique for managing over-determined constraint satisfaction problems. A problem in constraint relaxation is the selection of the appr...