881 search results - page 116 / 177 » Solving satisfiability problems with preferences |
AMAI
2005
Springer
13 years 7 months ago
2005
Springer
Many algorithms for Boolean satisfiability (SAT) work within the framework of resolution as a proof system, and thus on unsatisfiable instances they can be viewed as attempting to...
SIAMREV
2010
13 years 2 months ago
2010
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
COCOON
2005
Springer
14 years 1 months ago
2005
Springer
Many web-based systems have a tiered application architecture, in which a request needs to transverse all the tiers before finishing its processing. One of the most important QoS...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In this paper we present an equilibrium value based framework for solving SDPs via the multiplicative weight update method which is different from the one in Kale's thesis [K...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Assume a coevolutionary algorithm capable of storing and utilizing all phenotypes discovered during its operation, for as long as it operates on a problem; that is, assume an algo...