16404 search results - page 186 / 3281 » A set coverage problem |
135
Voted
TIT
2011
14 years 10 months ago
2011
Abstract—The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a tar...
152
Voted
VLSM
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Many problems in image analysis and computer vision involving boundaries and regions can be cast in a variational formulation. This means that m-surfaces, e.g. curves and...
144
Voted
FSTTCS
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. We describe some new, simple and apparently general methods for designing FPT algorithms, and illustrate how these can be used to obtain a signi cantly improved FPT algor...
120
click to vote
IJCAI
2007
15 years 5 months ago
2007
ESSENCE is a new formal language for specifying combinatorial problems in a manner similar to natural rigorous specifications that use a mixture of natural language and discrete ...
144
Voted
NIPS
2004
15 years 4 months ago
2004
In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. Wh...