3510 search results - page 178 / 702 » Searching with numbers |
168
click to vote
IEEEHPCS
2010
15 years 5 months ago
2010
Abstract. In this paper, we explore the two well-known principles of diversification and intensification in portfolio-based parallel SAT solving. These dual concepts play an impo...
146
click to vote
DEBU
2010
15 years 6 months ago
2010
A major hardness of processing searches issued in the form of keywords on structured data is the ambiguity problem. A set of keywords itself is not a complete piece of information...
162
click to vote
ICDCS
2007
IEEE
16 years 28 days ago
2007
IEEE
In unstructured peer-to-peer (P2P) networks, the overlay topology (or connectivity graph) among peers is a crucial component in addition to the peer/data organization and search. ...
177
click to vote
WSDM
2009
ACM
16 years 1 months ago
2009
ACM
With the overwhelming number of reports on similar events originating from different sources on the web, it is often hard, using existing web search paradigms, to find the origi...
162
click to vote
FOCS
1994
IEEE
15 years 10 months ago
1994
IEEE
We establish a nonlinear lower bound for halfplane range searching over a group. Specifically, we show that summing up the weights of n (weighted) points within n halfplanes requir...