Sciweavers

624 search results - page 103 / 125
» Mutant Query Plans
Sort
View
WSDM
2012
ACM
243views Data Mining» more  WSDM 2012»
12 years 5 months ago
No search result left behind: branching behavior with browser tabs
Today’s Web browsers allow users to open links in new windows or tabs. This action, which we call ‘branching’, is sometimes performed on search results when the user plans t...
Jeff Huang, Thomas Lin, Ryen W. White
ICDE
2005
IEEE
147views Database» more  ICDE 2005»
14 years 11 months ago
Cost-Driven General Join View Maintenance over Distributed Data Sources
Maintaining materialized views that have join conditions between arbitrary pairs of data sources possibly with cycles is critical for many applications. In this work, we model vie...
Bin Liu, Elke A. Rundensteiner
ICML
2008
IEEE
14 years 10 months ago
Reinforcement learning with limited reinforcement: using Bayes risk for active learning in POMDPs
Partially Observable Markov Decision Processes (POMDPs) have succeeded in planning domains that require balancing actions that increase an agent's knowledge and actions that ...
Finale Doshi, Joelle Pineau, Nicholas Roy
ECML
2005
Springer
14 years 3 months ago
Active Learning in Partially Observable Markov Decision Processes
This paper examines the problem of finding an optimal policy for a Partially Observable Markov Decision Process (POMDP) when the model is not known or is only poorly specified. W...
Robin Jaulmes, Joelle Pineau, Doina Precup
IPPS
2003
IEEE
14 years 3 months ago
Performance Modeling of the Grace Hash Join on Cluster Architectures
Aim of the paper is to develop a concise but comprehensive analytical model for the well-known Grace Hash Join algorithm on cost effective cluster architectures. This approach is ...
Erich Schikuta