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...
Abstract This paper reports our evaluation of the accuracy of capturing a user’s intent in an informationseeking task. Specifically, we would like to assess how accurately a use...
– The current approaches for linking information across sources, often called record linkage, require finding common attributes between the sources and comparing the records usin...
Biomolecular networks dynamically respond to stimuli and implement cellular function. Understanding these dynamic changes is the key challenge for cell biologists. As biomolecular...
Xiaohua Hu, Fang-Xiang Wu, Michael K. Ng, Bahrad A...
In the age of electronic commerce, with low-cost information access, it has been recognized that a bundle search in a combinatorial trade is very valuable for buyers. Optimal trav...