Sciweavers

589 search results - page 69 / 118
» Local Search Algorithms for SAT: An Empirical Evaluation
Sort
View
PPOPP
2010
ACM
15 years 9 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...
SIGIR
2003
ACM
15 years 5 months ago
Evaluating different methods of estimating retrieval quality for resource selection
In a federated digital library system, it is too expensive to query every accessible library. Resource selection is the task to decide to which libraries a query should be routed....
Henrik Nottelmann, Norbert Fuhr
JCC
2011
154views more  JCC 2011»
14 years 2 months ago
Can we trust docking results? Evaluation of seven commonly used programs on PDBbind database
: Docking is one of the most commonly used techniques in drug design. It is used for both identifying correct poses of a ligand in the binding site of a protein as well as for the ...
Dariusz Plewczynski, Michal Lazniewski, Rafal Augu...
JAIR
2008
130views more  JAIR 2008»
14 years 11 months ago
Online Planning Algorithms for POMDPs
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
Stéphane Ross, Joelle Pineau, Sébast...
WADS
2005
Springer
149views Algorithms» more  WADS 2005»
15 years 5 months ago
Balanced Aspect Ratio Trees Revisited
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
Amitabh Chaudhary, Michael T. Goodrich