Sciweavers

419 search results - page 66 / 84
» An LP-Designed Algorithm for Constraint Satisfaction
Sort
View
GECCO
2004
Springer
284views Optimization» more  GECCO 2004»
14 years 1 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
PKDD
2004
Springer
155views Data Mining» more  PKDD 2004»
14 years 1 months ago
Ensemble Feature Ranking
A crucial issue for Machine Learning and Data Mining is Feature Selection, selecting the relevant features in order to focus the learning search. A relaxed setting for Feature Sele...
Kees Jong, Jérémie Mary, Antoine Cor...
CSCLP
2003
Springer
14 years 1 months ago
Experimental Evaluation of Interchangeability in Soft CSPs
Abstract. In [8], Freuder defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently [2], we extended the definition of interchangeability to Soft ...
Nicoleta Neagu, Stefano Bistarelli, Boi Faltings
SAC
2006
ACM
14 years 2 months ago
Post-partition reconciliation protocols for maintaining consistency
This paper addresses design exploration for protocols that are employed in systems with availability-consistency tradeoffs. Distributed data is modelled as states of objects repl...
Mikael Asplund, Simin Nadjm-Tehrani
PODS
1999
ACM
95views Database» more  PODS 1999»
14 years 23 days ago
Minimal Data Upgrading to Prevent Inference and Association
Despite advances in recent years in the area of mandatory access control in database systems, today's information repositories remain vulnerable to inference and data associa...
Steven Dawson, Sabrina De Capitani di Vimercati, P...