881 search results - page 11 / 177 » Solving satisfiability problems with preferences |
SIAMJO
2010
13 years 3 months ago
2010
We propose a Newton-CG primal proximal point algorithm for solving large scale log-determinant optimization problems. Our algorithm employs the essential ideas of the proximal poi...
CPAIOR
2006
Springer
13 years 10 months ago
2006
Springer
As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft co...
EOR
2008
13 years 8 months ago
2008
The car sequencing problem involves scheduling cars along an assembly line while satisfying capacity constraints. In this paper, we describe an Ant Colony Optimization (ACO) algor...
VLDB
1997
ACM
14 years 23 days ago
1997
ACM
Many sources on the Internet and elsewhere rank the objects in query results according to how well these objects match the original query. For example, a real-estate agent might r...
IJCNN
2000
IEEE
14 years 1 months ago
2000
IEEE
In our recent work, a general method called the stable state analysis technique was developed to determine constraints that the weights in the Hopfield energy function must satisf...