1381 search results - page 99 / 277 » Computational Complexity of Constraint Satisfaction |
137
click to vote
CP
2007
Springer
15 years 10 months ago
2007
Springer
Symmetry is an important factor in solving many constraint satisfaction problems. One common type of symmetry is when we have symmetric values. We can eliminate such value symmetr...
130
click to vote
IUI
2004
ACM
15 years 9 months ago
2004
ACM
In order to give people ubiquitous access to software applications, device controllers, and Internet services, it will be necessary to automatically adapt user interfaces to the c...
136
click to vote
AI
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...
134
click to vote
EOR
2010
15 years 4 months ago
2010
This paper presents an Adaptive Tabu Search algorithm (denoted by ATS) for solving a problem of curriculum-based course timetabling. The proposed algorithm follows a general frame...
143
click to vote
ANOR
2004
15 years 4 months ago
2004
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...