16404 search results - page 885 / 3281 » A set coverage problem |
221
click to vote
EUROGP
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. Turing machines are playing an increasingly significant role in Computer Science domains such as bioinformatics. Instead of directly formulating a solution to a problem, ...
185
click to vote
ASUNAM
2010
IEEE
15 years 9 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
160
click to vote
DAGSTUHL
2007
15 years 9 months ago
2007
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...
208
click to vote
HIS
2007
15 years 9 months ago
2007
Meta-Learning has been used to relate the performance of algorithms and the features of the problems being tackled. The knowledge in Meta-Learning is acquired from a set of meta-e...
178
click to vote
NIPS
2008
15 years 9 months ago
2008
We study the profit-maximization problem of a monopolistic market-maker who sets two-sided prices in an asset market. The sequential decision problem is hard to solve because the ...