Sciweavers

4908 search results - page 372 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
GECCO
2004
Springer
284views Optimization» more  GECCO 2004»
16 years 6 days 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
GW
2003
Springer
174views Biometrics» more  GW 2003»
16 years 1 days ago
Gesture Components for Natural Interaction with In-Car Devices
Abstract. The integration of more and more functionality into the human machine interface (HMI) of vehicles increases the complexity of device handling. Thus optimal use of differ...
Martin Zobl, Ralf Nieschulz, Michael Geiger, Manfr...
CEC
2009
IEEE
15 years 11 months ago
Memory-enhanced Evolutionary Robotics: The Echo State Network Approach
— Interested in Evolutionary Robotics, this paper focuses on the acquisition and exploitation of memory skills. The targeted task is a well-studied benchmark problem, the Tolman ...
Cédric Hartland, Nicolas Bredeche, Mich&egr...
CP
1999
Springer
15 years 11 months ago
A Framework for Constraint Programming Based Column Generation
Column generation is a state-of-the-art method for optimally solving di cult large-scale optimization problems such as airline crew assignment. We show how to apply column generati...
Ulrich Junker, Stefan E. Karisch, Niklas Kohl, Bo ...
CEC
2009
IEEE
15 years 10 months ago
Search methodologies for efficient planetary site selection
Landing on distant planets is always a challenging task due to the distance and hostile environments found. In the design of autonomous hazard avoidance systems we find the particu...
Luís F. Simões, Tiago C. Pais, Rita ...