8016 search results - page 1405 / 1604 » On the practical genetic algorithms |
188
click to vote
FIMI
2003
15 years 7 months ago
2003
A simple new algorithm is suggested for frequent itemset mining, using item probabilities as the basis for generating candidates. The method first finds all the frequent items, an...
156
click to vote
ICAI
2003
15 years 7 months ago
2003
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
157
click to vote
IJCAI
2003
15 years 7 months ago
2003
Many of standard practical techniques of solving constraint satisfaction problems use various decomposition methods to represent a problem as a combination of smaller ones. We stu...
166
click to vote
SSWMC
2004
15 years 7 months ago
2004
The goal of image steganography is to embed information in a cover image using modifications that are undetectable. In actual practice, however, most techniques produce stego imag...
171
click to vote
SSWMC
2004
15 years 7 months ago
2004
A possible solution to the difficult problem of geometrical distortion of watermarked images in a blind watermarking scenario is to use a template grid in the autocorrelation func...