Sciweavers

2031 search results - page 314 / 407
» Approximation Algorithms for 2-Stage Stochastic Optimization...
Sort
View
AAAI
2010
13 years 9 months ago
Local Search in Histogram Construction
The problem of dividing a sequence of values into segments occurs in database systems, information retrieval, and knowledge management. The challenge is to select a finite number ...
Felix Halim, Panagiotis Karras, Roland H. C. Yap
ESA
2009
Springer
167views Algorithms» more  ESA 2009»
14 years 23 days ago
Clustering-Based Bidding Languages for Sponsored Search
Sponsored search auctions provide a marketplace where advertisers can bid for millions of advertising opportunities to promote their products. The main difficulty facing the adver...
Mohammad Mahdian, Grant Wang
ATAL
2009
Springer
14 years 2 months ago
An empirical analysis of value function-based and policy search reinforcement learning
In several agent-oriented scenarios in the real world, an autonomous agent that is situated in an unknown environment must learn through a process of trial and error to take actio...
Shivaram Kalyanakrishnan, Peter Stone
KDD
2012
ACM
187views Data Mining» more  KDD 2012»
11 years 10 months ago
Online learning to diversify from implicit feedback
In order to minimize redundancy and optimize coverage of multiple user interests, search engines and recommender systems aim to diversify their set of results. To date, these dive...
Karthik Raman, Pannaga Shivaswamy, Thorsten Joachi...
ICPP
2005
IEEE
14 years 1 months ago
Filter Decomposition for Supporting Coarse-Grained Pipelined Parallelism
We consider the filter decomposition problem in supporting coarse-grained pipelined parallelism. This form of parallelism is suitable for data-driven applications in scenarios wh...
Wei Du, Gagan Agrawal