673 search results - page 108 / 135 » Preference-Based Problem Solving for Constraint Programming |
IFIP
2007
Springer
14 years 1 months ago
2007
Springer
The support of QoS properties in component-based software requires the run-time selection of appropriate concrete QoS contracts at the ports of the interacting components. Such a s...
CP
2005
Springer
14 years 1 months ago
2005
Springer
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...
ORL
2006
13 years 7 months ago
2006
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
NIPS
2004
13 years 9 months ago
2004
We propose a new method for clustering based on finding maximum margin hyperplanes through data. By reformulating the problem in terms of the implied equivalence relation matrix, ...
ISPD
2000
ACM
13 years 12 months ago
2000
ACM
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...