Sciweavers

18 search results - page 1 / 4
» Hybrid tractability of soft constraint problems
Sort
View
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 7 months ago
Hybrid tractability of soft constraint problems
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable effort has been made in identifying properties which ensure tractabi...
Martin C. Cooper, Stanislav Zivný
IJCAI
2003
13 years 8 months ago
A Maximal Tractable Class of Soft Constraints
Many optimization problems can be expressed us­ ing some form of soft constraints, where different measures of desirability arc associated with differ­ ent combinations of domai...
David A. Cohen, Martin C. Cooper, Peter Jeavons, A...
AI
2011
Springer
13 years 2 months ago
Hybrid tractability of valued constraint problems
Martin C. Cooper, Stanislav Zivny
ECAI
2008
Springer
13 years 9 months ago
Hybrid tractable CSPs which generalize tree structure
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable progress has been made in identifying properties which ensure tracta...
Martin C. Cooper, Peter G. Jeavons, András ...
ACISICIS
2007
IEEE
14 years 1 months ago
A Hybrid Simulated Annealing with Kempe Chain Neighborhood for the University Timetabling Problem
This paper addresses the problem of finding a feasible solution for the University Course Timetabling Problem (UCTP), i.e. a solution that satisfies all the so-called hard const...
Mauritsius Tuga, Regina Berretta, Alexandre Mendes