Sciweavers

50 search results - page 1 / 10
» Lagrange Multiplier Method for Multi-campaign Assignment Pro...
Sort
View
GECCO
2004
Springer
284views Optimization» more  GECCO 2004»
13 years 10 months ago
Lagrange Multiplier Method for Multi-campaign Assignment Problem
It is crucial to maximize marketing efficiency and customer satisfaction in personalized marketing. In this paper, we raise the multiple recommendation problem which occurs when pe...
Yong-Hyuk Kim, Byung Ro Moon
GECCO
2005
Springer
219views Optimization» more  GECCO 2005»
13 years 10 months ago
An evolutionary lagrangian method for the 0/1 multiple knapsack problem
We propose a new evolutionary approach to solve the 0/1 multiple knapsack problem. We approach the problem from a new viewpoint different from traditional methods. The most remar...
Yourim Yoon, Yong-Hyuk Kim, Byung Ro Moon
TKDE
2008
118views more  TKDE 2008»
13 years 4 months ago
A Lagrangian Approach for Multiple Personalized Campaigns
The multicampaign assignment problem is a campaign model to overcome the multiple-recommendation problem that occurs when conducting several personalized campaigns simultaneously. ...
Yong-Hyuk Kim, Yourim Yoon, Byung Ro Moon
SIGGRAPH
1996
ACM
13 years 9 months ago
Linear-Time Dynamics Using Lagrange Multipliers
Current linear-time simulation methods for articulated figures are based exclusively on reduced-coordinate formulations. This paper describes a general, non-iterative linear-time ...
David Baraff
JMIV
2010
184views more  JMIV 2010»
13 years 3 months ago
An Optimal Control Formulation of an Image Registration Problem
The basic idea of image registration is to find a reasonable transformation of an image so that the resulting difference between it and another image is made small. We derive an o...
Eunjung Lee, Max Gunzburger