661 search results - page 43 / 133 » Combining Information using Hard Constraints |
104
click to vote
EOR
2010
15 years 17 days 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...
104
Voted
CPAIOR
2007
Springer
15 years 6 months ago
2007
Springer
The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree...
104
click to vote
PODS
2008
ACM
16 years 19 days ago
2008
ACM
In the study of data exchange one usually assumes an openworld semantics, making it possible to extend instances of target schemas. An alternative closed-world semantics only move...
120
Voted
SAT
2010
Springer
14 years 11 months ago
2010
Springer
This paper presents a detailed empirical study of local search for Boolean satisfiability (SAT), highlighting several interesting properties, some of which were previously unknown...
109
Voted
JMM2
2008
15 years 14 days ago
2008
The paper improves the reliability of audio streams in a lossy channel. The mechanism groups audio data samples into source and carrier sets. The carrier set carry the information ...