New Stochastic Algorithms for Scheduling Ads in Sponsored Search

2007 ◽  
Author(s):  
Esteban Feuerstein ◽  
Pablo Ariel Heiber ◽  
Javier Martínez-Viademonte ◽  
Ricardo Baeza-Yates
Keyword(s):  
Stochastic Algorithms ◽  
Sponsored Search

New Stochastic Algorithms for Scheduling Ads in Sponsored Search

2007 ◽  
Author(s):  
Esteban Feuerstein ◽  
Esteban Feuerstein ◽  
Pablo Ariel Heiber ◽  
Pablo Ariel Heiber ◽  
Javier Martínez-Viademonte ◽  
...  
Keyword(s):  
Stochastic Algorithms ◽  
Sponsored Search

Deal-Seeking Versus Brand-Seeking: Search Behaviors and Purchase Propensities in Sponsored Search Platforms

MIS Quarterly ◽  
2016 ◽  
Vol 40 (1) ◽  
pp. 187-203 ◽  
Author(s):  
Il Im ◽  
◽  
Jongkun Jun ◽  
Wonseok Oh ◽  
Seok-Oh Jeong ◽  
...  
Keyword(s):  
Sponsored Search ◽  
Search Behaviors

A new algorithm for finding CRM-model coefficients

2019 ◽  
Vol 5 (3) ◽  
pp. 164-185 ◽  
Author(s):  
Alexander D. Bekman ◽  
Sergey V. Stepanov ◽  
Alexander A. Ruchkin ◽  
Dmitry V. Zelenin
Keyword(s):  
Approximate Solution ◽  
Optimization Problem ◽  
Optimal Solution ◽  
Complex Form ◽  
Approximate Solutions ◽  
The Other ◽  
Programming Algorithm ◽  
Stochastic Algorithms ◽  
Large Set ◽  
Flow Rates

The quantitative evaluation of producer and injector well interference based on well operation data (profiles of flow rates/injectivities and bottomhole/reservoir pressures) with the help of CRM (Capacitance-Resistive Models) is an optimization problem with large set of variables and constraints. The analytical solution cannot be found because of the complex form of the objective function for this problem. Attempts to find the solution with stochastic algorithms take unacceptable time and the result may be far from the optimal solution. Besides, the use of universal (commercial) optimizers hides the details of step by step solution from the user, for example&nbsp;— the ambiguity of the solution as the result of data inaccuracy.<br> The present article concerns two variants of CRM problem. The authors present a new algorithm of solving the problems with the help of “General Quadratic Programming Algorithm”. The main advantage of the new algorithm is the greater performance in comparison with the other known algorithms. Its other advantage is the possibility of an ambiguity analysis. This article studies the conditions which guarantee that the first variant of problem has a unique solution, which can be found with the presented algorithm. Another algorithm for finding the approximate solution for the second variant of the problem is also considered. The method of visualization of approximate solutions set is presented. The results of experiments comparing the new algorithm with some previously known are given.

The Role of Relevance in Sponsored Search

2016 ◽  
Author(s):  
Luca Aiello ◽  
Ioannis Arapakis ◽  
Ricardo Baeza-Yates ◽  
Xiao Bai ◽  
Nicola Barbieri ◽  
...  
Keyword(s):  
Sponsored Search

scholarly journals The convergence of stochastic algorithms solving flow shop scheduling

2002 ◽  
Vol 285 (1) ◽  
pp. 101-117 ◽  
Author(s):  
K. Steinhöfel ◽  
A. Albrecht ◽  
C.K. Wong
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Stochastic Algorithms ◽  
Shop Scheduling
Sign in / Sign up

Export Citation Format

Share Document