2109 search results - page 93 / 422 » Solving Necklace Constraint Problems |
136
click to vote
GECCO
2004
Springer
15 years 10 months 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...
143
Voted
EOR
2007
15 years 4 months ago
2007
The knapsack problem (KP) is generalized to the case where items are partially ordered through a set of precedence relations. As in ordinary KPs, each item is associated with proï...
141
click to vote
APJOR
2010
15 years 5 months ago
2010
In this paper we apply the well known sample average approximation (SAA) method to solve a class of stochastic variational inequality problems (SVIPs). We investigate the existenc...
152
click to vote
FLAIRS
2008
15 years 7 months ago
2008
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
134
click to vote
ECAI
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We address the problem of representing big sets of binary constraints compactly. Binary constraints in the form of 2literal clauses are ubiquitous in propositional formul...