6829 search results - page 1059 / 1366 » Quantitative Generalizations of Languages |
182
click to vote
CP
2007
Springer
16 years 27 days ago
2007
Springer
Motivated by the performance improvements made to SAT solvers in recent years, a number of different encodings of constraints into SAT have been proposed. Concrete examples are th...
174
click to vote
CP
2007
Springer
16 years 27 days 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...
154
click to vote
CP
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. Stochastic Local Search (SLS) is a simple and effective paradigm for attacking a variety of Combinatorial (Optimization) Problems (COP). However, it is often non-trivial...
203
Voted
CP
2007
Springer
16 years 27 days ago
2007
Springer
While many real-world combinatorial problems can be advantageously modeled and solved using Constraint Programming, scalability remains a major issue in practice. Constraint models...
171
click to vote
CP
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. The SEQUENCE constraint is useful in modelling car sequencing, rostering, scheduling and related problems. We introduce half a dozen new encodings of the SEQUENCE constra...