Abstract. In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to...
Montserrat Abril, Miguel A. Salido, Federico Barbe...
Keyword3 generation for search engine advertising is an important problem for sponsored search or paidplacement advertising. A recent strategy in this area is bidding on nonobviou...
We present a solution to the problem of regular expression searching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 and LZW variants. Give...
General purpose Web search engines are becoming ineffective due to the rapid growth and changes in the contents of the World Wide Web. Meta-search engines help a bit by having a b...
Leo Yuen, Matthew Chang, Ying Kit Lai, Chung Keung...
This paper proposes a hybrid genetic algorithm for multiple sequence alignment. The algorithm evolves guide sequences and aligns input sequences based on the guide sequences. It a...