1051 search results - page 147 / 211 » Foundations of Constraint Satisfaction |
160
Voted
GECCO
2004
Springer
16 years 4 days ago
2004
Springer
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...
192
click to vote
ILP
2004
Springer
16 years 4 days ago
2004
Springer
Abstract. Logic Programs with Annotated Disjunctions (LPADs) provide a simple and elegant framework for integrating probabilistic reasoning and logic programming. In this paper we ...
172
click to vote
PKDD
2004
Springer
16 years 3 days ago
2004
Springer
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...
193
click to vote
ISQED
2003
IEEE
16 years 1 days ago
2003
IEEE
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...
153
click to vote
CSCLP
2003
Springer
16 years 36 min ago
2003
Springer
Abstract. In [8], Freuder defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently [2], we extended the definition of interchangeability to Soft ...