15485 search results - page 175 / 3097 » Computing Optimal Subsets |
160
click to vote
JACM
1998
15 years 6 months ago
1998
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
180
click to vote
CCE
2005
15 years 6 months ago
2005
In practical system identification, process optimization and controller design, it is often desirable to simultaneously handle several objectives and constraints. In some cases, t...
151
click to vote
ATAL
2004
Springer
15 years 11 months ago
2004
Springer
Distributed Partially Observable Markov Decision Problems (POMDPs) are emerging as a popular approach for modeling multiagent teamwork where a group of agents work together to joi...
134
click to vote
RECOMB
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. In this paper, we focus on finding complex annotation patterns representing novel and interesting hypotheses from gene annotation data. We define a generalization of th...
210
click to vote
RSP
2000
IEEE
15 years 10 months ago
2000
IEEE
Dataflow programming has proven to be popular for representing applications in rapid prototyping tools for digital signal processing (DSP); however, existing dataflow design tools...