16082 search results - page 357 / 3217 » Algorithms for Marketing-Mix Optimization |
146
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
In this paper, we present a method to estimate the number of reconfiguration steps that a time-constrained algorithm can accommodate. This analysis demonstrates how one would attac...
174
click to vote
SODA
1996
ACM
15 years 8 months ago
1996
ACM
Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
136
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The floating-point implementation of a function often reduces to a polynomial approximation on an interval. Remez algorithm provides the polynomial closest to the function, but th...
214
click to vote
CEC
2011
IEEE
14 years 6 months ago
2011
IEEE
—We develop a stochastic local search algorithm for finding Pareto points for multi-criteria optimization problems. The algorithm alternates between different single-criterium o...
164
click to vote
CISS
2008
IEEE
16 years 1 months ago
2008
IEEE
— It has been known since the early 1990s that backpressure-type algorithms for communication networks (such as the Max-Weight algorithm) can be used to approximately solve stati...