Searching for "Computing Optimal Subsets." – sorted by Relevance.
-
Learning from data of variable quality
- . In both cases, efficient algorithms are provided for computing the optimal subset of data. 1 Introduction
- Cited by 3 (2 self) – Add To MetaCart
-
Learning from Data of Variable Quality
- . In both cases, efficient algorithms are provided for computing the optimal subset of data. 1 Introduction
- Add To MetaCart
-
Semantic Selection of Premisses for Automated Theorem Proving
- interpretations using an automated model finder, uses the interpretations to compute the optimal subset
- Add To MetaCart
-
Optimal Nonmyopic Value of Information in Graphical Models --
- . The dynamic programming algorithm described above computes the optimal subset with budget B in ( 1 6 n3 + O
- Add To MetaCart
-
Forbidden Intervals for Open-Shop Problems
- can be solved by a dynamic programming algorithm which computes the optimal subset-sum but also all
- Cited by 2 (1 self) – Add To MetaCart
-
Optimal nonmyopic value of information in graphical models - efficient algorithms and theoretical
- and compute La:b(N). Alg. 1 uses the quantities Λa:b to recover the optimal subset by tracing the maximal
- Cited by 9 (4 self) – Add To MetaCart
-
Learning Optimal Subsets with Implicit User Preferences
- et al., 2003; Domshlak and Joachims, 2005]. The problem of computing the optimal subset, assuming a
- Add To MetaCart
-
Manpower Allocation With Time Windows And Job
- compute an optimal subset from the scheduled workers such that: 1) All the workers in the subset have a
- Add To MetaCart
-
Preferences over sets
- [4]. We continue with suggesting two different computational schemes for computing an optimal subset
- Cited by 4 (2 self) – Add To MetaCart
-
Computing Optimal Hypotheses Efficiently for Boosting
- is 2 M , we are able to compute the optimal subset S in O(M)-time. First, without loss of generality
- Cited by 3 (0 self) – Add To MetaCart

