881 search results - page 62 / 177 » Solving satisfiability problems with preferences |
EMO
2006
Springer
14 years 13 days ago
2006
Springer
1 In most real world optimization problems several optimization goals have to be considered in parallel. For this reason, there has been a growing interest in Multi-Objective Optim...
ATAL
2010
Springer
13 years 10 months ago
2010
Springer
In the course allocation problem, a university administrator seeks to efficiently and fairly allocate schedules of over-demanded courses to students with heterogeneous preferences...
DAC
2004
ACM
14 years 9 months ago
2004
ACM
Bounded Model Checking (BMC) relies on solving a sequence of highly correlated Boolean satisfiability (SAT) problems, each of which corresponds to the existence of counter-example...
AIPS
2006
13 years 10 months ago
2006
In this paper, we propose a new approach, called lemma-reusing, for accelerating SAT based planning and scheduling. Generally, SAT based approaches generate a sequence of SAT prob...
WWW
2005
ACM
14 years 9 months ago
2005
ACM
Website privacy policies state the ways that a site will use personal identifiable information (PII) that is collected from fields and forms in web-based transactions. Since these...