In a recent paper an algorithm for solving MAX-SAT was proposed which worked by clustering good solutions and restarting the search from the closest feasible solutions. This was sh...
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...
Discovery of association rules from large databases of item sets is an important data mining problem. Association rules are usually stored in relational databases for future use i...
We survey results on self-organizing data structures for the search problem and concentrate on two very popular structures: the unsorted linear list, and the binary search tree. Fo...
Current search mechanisms of DHT-based P2P systems can well handle a single keyword search problem. Other than single keyword search, multi-keyword search is quite popular and use...
Hanhua Chen, Hai Jin, Jiliang Wang, Lei Chen 0002,...