4561 search results - page 234 / 913 » Value and the information market |
177
click to vote
GECCO
2005
Springer
16 years 5 days ago
2005
Springer
Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem e...
147
click to vote
ECML
2001
Springer
15 years 11 months ago
2001
Springer
When correct priors are known, Bayesian algorithms give optimal decisions, and accurate confidence values for predictions can be obtained. If the prior is incorrect however, these...
151
click to vote
PVLDB
2010
15 years 5 months ago
2010
Random perturbation is a promising technique for privacy preserving data mining. It retains an original sensitive value with a certain probability and replaces it with a random va...
179
click to vote
JMLR
2010
15 years 1 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
227
click to vote
MOBIHOC
2009
ACM
16 years 1 months ago
2009
ACM
Spectrum is a critical yet scarce resource and it has been shown that dynamic spectrum access can significantly improve spectrum utilization. To achieve this, it is important to ...