2489 search results - page 114 / 498 » On the Subgroup Distance Problem |
126
click to vote
EOR
2007
15 years 3 months ago
2007
Abstract. Given an optimization problem with a composite of a convex and componentwise increasing function with a convex vector function as objective function, by means of the conj...
155
click to vote
ICML
2000
IEEE
16 years 4 months ago
2000
IEEE
As opposed to traditional supervised learning, multiple-instance learning concerns the problem of classifying a bag of instances, given bags that are labeled by a teacher as being...
133
click to vote
ESA
2004
Springer
15 years 9 months ago
2004
Springer
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
147
click to vote
ECAI
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. This paper studies algorithms for the Disjunctive Temporal Problem (DTP) a quite general temporal reasoning problem introduced in [12]. This problem involves the satisfac...
115
click to vote
COR
2007
15 years 4 months ago
2007
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...