2109 search results - page 339 / 422 » Solving Necklace Constraint Problems |
155
click to vote
ORL
2006
15 years 4 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...
123
click to vote
IPPS
2009
IEEE
15 years 11 months ago
2009
IEEE
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
165
click to vote
ILP
2004
Springer
15 years 9 months ago
2004
Springer
For the last ten years a lot of work has been devoted to propositionalization techniques in relational learning. These techniques change the representation of relational problems t...
115
click to vote
CP
2003
Springer
15 years 9 months ago
2003
Springer
Arc consistency plays a central role in solving Constraint Satisfaction Problems. This is the reason why many algorithms have been proposed to establish it. Recently, an algorithm ...
135
click to vote
APLAS
2000
ACM
15 years 8 months ago
2000
ACM
We have implemented Kima, an automated error correction system for concurrent logic programs. Kima corrects near-misses such as wrong variable occurrences in the absence of explici...