4112 search results - page 343 / 823 » Efficient Algorithms for the Spoonerism Problem |
197
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of n trials so as to maximize the total payoff of the chosen strategies. While ...
169
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 ...
179
click to vote
IMECS
2007
15 years 8 months ago
2007
—This paper presents a new metamodel-assisted metaheuristic algorithm for optimisation problems involving computationally expensive simulations. The algorithm, called Global Prob...
179
click to vote
MASS
2010
15 years 4 months ago
2010
We address the energy-efficient data redistribution problem in data intensive sensor networks (DISNs). The key question in sensor networks with large volumes of sensory data is how...
166
click to vote
ASPDAC
2009
ACM
16 years 1 months ago
2009
ACM
– With the popularity of Multiple Power Domain (MPD) design, the multi-domain power network noise analysis and minimization is becoming important. This paper describes an efficie...