365 search results - page 17 / 73 » An Approach to Multiply Segmented Constraint Satisfaction Pr... |
KCAP
2005
ACM
14 years 29 days ago
2005
ACM
Effective reuse of Knowledge Bases (KBs) often entails the expensive task of identifying plausible KB-PS (Problem Solver) combinations. We propose a novel technique based on Const...
AIPS
2006
13 years 8 months ago
2006
Recent research in AI Planning is focused on improving the quality of the generated plans. PDDL3 incorporates hard and soft constraints on goals and the plan trajectory. Plan traj...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
Forma analysis provides an approach to formally derive domain specific operators based on domain-independent operator templates by manipulating a set of equivalence relations (i....
TKDE
2008
13 years 7 months ago
2008
The multicampaign assignment problem is a campaign model to overcome the multiple-recommendation problem that occurs when conducting several personalized campaigns simultaneously. ...
CP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...