3016 search results - page 381 / 604 » A Granular Approach to Web Search Result Presentation |
133
click to vote
WSDM
2012
ACM
13 years 9 months ago
2012
ACM
Most standard information retrieval models use a single source of information (e.g., the retrieval corpus) for query formulation tasks such as term and phrase weighting and query ...
115
click to vote
WWW
2007
ACM
16 years 2 months ago
2007
ACM
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
143
click to vote
BMCBI
2007
15 years 2 months ago
2007
Background: Neuroscientists often need to access a wide range of data sets distributed over the Internet. These data sets, however, are typically neither integrated nor interopera...
114
click to vote
AIPS
2004
15 years 3 months ago
2004
Oversubscribed scheduling problems require removing tasks when enough resources are not available. Prior AI approaches have mostly been constructive or repairbased heuristic searc...
AIPS
2003
15 years 3 months ago
2003
Symbolic universal planning based on the reduced Ordered Binary Decision Diagram (OBDD) has been shown to be an efficient approach for planning in non-deterministic domains. To d...