814 search results - page 4 / 163 » Optimal pairings |
COR
2002
13 years 9 months ago
2002
ITIIS
2010
2010
Reversible Watermarking Method Using Optimal Histogram Pair Shifting Based on Prediction and Sorting
13 years 8 months ago
To be reversible as a data hiding method, the original content and hidden message should be completely recovered. One important objective of this approach is to achieve high embed...
ENTCS
2007
13 years 9 months ago
2007
We give a uniform type-systematic account of a number of optimizations and the underlying analyses for a bytecode-like stack-based low-level language, including analysis soundness...
PPSN
2010
Springer
13 years 7 months ago
2010
Springer
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...
ICML
2001
IEEE
14 years 10 months ago
2001
IEEE
Direct policy search is a practical way to solve reinforcement learning problems involving continuous state and action spaces. The goal becomes finding policy parameters that maxi...