QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
Searching on the Internet has grown in importance over the last few years, as huge amount of information is invariably accumulated on the Web. The problem involves locating the des...
P. Deepa Shenoy, K. G. Srinivasa, Achint Oommen Th...
This paper develops and analyzes distributed search techniques for use in a peer-to-peer (P2P) network-based Information Retrieval (IR) system. In the absence of a centralized med...
Haizheng Zhang, W. Bruce Croft, Brian Neil Levine,...
Abstract. This paper presents a semantic web portal tool ONTOVIEWS for publishing RDF content on the web. ONTOVIEWS provides the portal designer with a content-based search engine ...
Component based software development is prone to unexpected interaction faults. The goal is to test as many potential interactions as is feasible within time and budget constraint...
Myra B. Cohen, Charles J. Colbourn, Alan C. H. Lin...