16082 search results - page 441 / 3217 » Algorithms for Marketing-Mix Optimization |
172
click to vote
CRV
2009
IEEE
16 years 2 months ago
2009
IEEE
The problem of online sampling of data, can be seen as a generalization of the classical secretary problem. The goal is to maximize the probability of picking the k highest scorin...
178
click to vote
GECCO
2004
Springer
16 years 1 months ago
2004
Springer
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...
163
click to vote
ICCAD
1999
IEEE
15 years 12 months ago
1999
IEEE
We present LEOPARD, a fanout optimization algorithm based on the effort delay model for near-continuous size buffer libraries. Our algorithm minimizes area under required timing a...
205
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
We propose in this paper an exploratory analysis algorithm for functional data. The method partitions a set of functions into K clusters and represents each cluster by a simple pr...
198
click to vote
DEDS
2006
15 years 7 months ago
2006
A class of time-varying discrete-event systems, named dynamic discrete-event systems, is defined. The goal of this paper is to provide a method which is modular and can be applied ...