1047 search results - page 161 / 210 » Searching Without a Heuristic: Efficient Use of Abstraction |
CIKM
1993
Springer
14 years 6 days ago
1993
Springer
match algorithms that can efficiently handleAbstract complex tests in the presence of large amounts of data. Match algorithms that are capable of handling large amounts of On the o...
MOBIHOC
2002
ACM
14 years 7 months ago
2002
ACM
We examine two aspects concerning the influence of unidirectional links on routing performance in multihop wireless networks. In the first part of the paper, we evaluate the benef...
EDBT
2006
ACM
14 years 8 months ago
2006
ACM
Abstract. We consider a collaboration of peers autonomously crawling the Web. A pivotal issue when designing a peer-to-peer (P2P) Web search engine in this environment is query rou...
SIGMOD
2008
ACM
14 years 8 months ago
2008
ACM
While database management systems offer a comprehensive solution to data storage, they require deep knowledge of the schema, as well as the data manipulation language, in order to...
ISCA
2005
IEEE
14 years 1 months ago
2005
IEEE
Memory latency tolerant architectures support thousands of in-flight instructions without scaling cyclecritical processor resources, and thousands of useful instructions can compl...