6618 search results - page 326 / 1324 » Web Search Engines |
181
click to vote
CSC
2008
15 years 8 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
185
click to vote
AINA
2004
IEEE
15 years 10 months ago
2004
IEEE
Link analysis has been used to enhance retrieval results of the web search for years. PageRank and HITS are the two well-known algorithms widely used by most researchers. The form...
198
click to vote
ICSE
2007
IEEE-ACM
16 years 6 months ago
2007
IEEE-ACM
Web services are a popular way of implementing a Service-Oriented Architecture. Testing can be used to help assure both the correctness and robustness of a web service. Because ma...
249
Voted
CIKM
2005
Springer
15 years 8 months ago
2005
Springer
Inverted index structures are the mainstay of modern text retrieval systems. They can be constructed quickly using off-line mergebased methods, and provide efficient support for ...