1298 search results - page 195 / 260 » The online set cover problem |
187
click to vote
SAT
2009
Springer
16 years 28 days ago
2009
Springer
Abstract. We present a new method to break symmetry in graph coloring problems. While most alternative techniques add symmetry breaking predicates in a pre-processing step, we deve...
172
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
157
click to vote
ICDM
2009
IEEE
16 years 1 months ago
2009
IEEE
—Methods for learning decision rules are being successfully applied to many problem domains, especially where understanding and interpretation of the learned model is necessary. ...
188
click to vote
ORL
2006
15 years 6 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...
173
click to vote
EUROMICRO
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract— Creating exercises for learners requires significant time. This is one reason, beside difficulties of discussing individualized tasks in a classroom setting, why often ...