881 search results - page 78 / 177 » Solving satisfiability problems with preferences |
ICCAD
2002
IEEE
14 years 5 months ago
2002
IEEE
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...
ICCBR
2009
Springer
13 years 6 months ago
2009
Springer
Previous approaches to case-based planning often finds a similar plan case to a new planning problem to adapt to solve the new problem. However, in the case base, there may be some...
SIAMJO
2010
13 years 3 months ago
2010
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
AUSAI
2005
Springer
14 years 2 months ago
2005
Springer
Most data-mining techniques seek a single model that optimizes an objective function with respect to the data. In many real-world applications several models will equally optimize...
ISMB
2000
13 years 10 months ago
2000
Ontologies are specifications of the concepts in a given field, and of the relationships among those concepts. The development of ontologies for molecular-biology information and ...