1332 search results - page 260 / 267 » An Efficient Algorithm for the Approximate Median Selection ... |
NIPS
2004
13 years 8 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
ML
2006
ACM
13 years 7 months ago
2006
ACM
Most game programs have a large number of parameters that are crucial for their performance. While tuning these parameters by hand is rather difficult, efficient and easy to use ge...
SIGIR
1997
ACM
13 years 11 months ago
1997
ACM
Word usage is domain dependent. A common word in one domain can be quite infrequent in another. In this study we exploit this property of word usage to improve document routing. W...
AIPS
2009
13 years 8 months ago
2009
Current state-of-the-art planners solve problems, easy and hard alike, by search, expanding hundreds or thousands of nodes. Yet, given the ability of people to solve easy problems...
AIPS
2009
13 years 8 months ago
2009
Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties while improving robustness and reducing the need for an overly conservative plan. Executive...