Sciweavers

1051 search results - page 147 / 211
» Foundations of Constraint Satisfaction
Sort
View
GECCO
2004
Springer
284views Optimization» more  GECCO 2004»
14 years 3 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
ILP
2004
Springer
14 years 3 months ago
Learning Logic Programs with Annotated Disjunctions
Abstract. Logic Programs with Annotated Disjunctions (LPADs) provide a simple and elegant framework for integrating probabilistic reasoning and logic programming. In this paper we ...
Fabrizio Riguzzi
PKDD
2004
Springer
155views Data Mining» more  PKDD 2004»
14 years 3 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...
ISQED
2003
IEEE
119views Hardware» more  ISQED 2003»
14 years 3 months ago
System and Framework for QA of Process Design Kits
In this paper, we evaluate the dependencies between tools, data and environment in process design kits, and present a framework for systematically analyzing the quality of the des...
M. C. Scott, M. O. Peralta, Jo Dale Carothers
CSCLP
2003
Springer
14 years 3 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