365 search results - page 1 / 73 » An Approach to Multiply Segmented Constraint Satisfaction Pr... |
AAAI
1994
13 years 6 months ago
1994
This paper describes an extension to the constraint satisfaction problem (CSP) approach called MUSE CSP (Multiply SEgmented Constraint Satisfaction Problem). This extension is esp...
GECCO
2004
Springer
13 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...
AAAI
2006
13 years 6 months ago
2006
We present a new formulation of distributed task assignment, called Generalized Mutual Assignment Problem (GMAP), which is derived from an NP-hard combinatorial optimization probl...
AI
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Variables and constraints in problem domains are often distributed. These distributed constraint satisfaction problems (DCSPs) lend themselves to multiagent solutions. Mo...
FLAIRS
2008
13 years 7 months ago
2008
Although timetabling has long been studied through constraint satisfaction based techniques, along with many alternatives, only recently work has been reported where distributed t...